mirror of
https://github.com/XRPLF/rippled.git
synced 2025-11-20 19:15:54 +00:00
encasulate lock inside container
This commit is contained in:
@@ -170,9 +170,6 @@ public:
|
|||||||
bool
|
bool
|
||||||
retrieve(key_type const& key, T& data);
|
retrieve(key_type const& key, T& data);
|
||||||
|
|
||||||
mutex_type&
|
|
||||||
peekMutex();
|
|
||||||
|
|
||||||
std::vector<key_type>
|
std::vector<key_type>
|
||||||
getKeys() const;
|
getKeys() const;
|
||||||
|
|
||||||
|
|||||||
@@ -668,29 +668,6 @@ TaggedCache<
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
template <
|
|
||||||
class Key,
|
|
||||||
class T,
|
|
||||||
bool IsKeyCache,
|
|
||||||
class SharedWeakUnionPointer,
|
|
||||||
class SharedPointerType,
|
|
||||||
class Hash,
|
|
||||||
class KeyEqual,
|
|
||||||
class Mutex>
|
|
||||||
inline auto
|
|
||||||
TaggedCache<
|
|
||||||
Key,
|
|
||||||
T,
|
|
||||||
IsKeyCache,
|
|
||||||
SharedWeakUnionPointer,
|
|
||||||
SharedPointerType,
|
|
||||||
Hash,
|
|
||||||
KeyEqual,
|
|
||||||
Mutex>::peekMutex() -> mutex_type&
|
|
||||||
{
|
|
||||||
return m_mutex;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <
|
template <
|
||||||
class Key,
|
class Key,
|
||||||
class T,
|
class T,
|
||||||
|
|||||||
@@ -27,8 +27,6 @@
|
|||||||
|
|
||||||
namespace ripple {
|
namespace ripple {
|
||||||
|
|
||||||
// FIXME: Need to clean up ledgers by index at some point
|
|
||||||
|
|
||||||
LedgerHistory::LedgerHistory(
|
LedgerHistory::LedgerHistory(
|
||||||
beast::insight::Collector::ptr const& collector,
|
beast::insight::Collector::ptr const& collector,
|
||||||
Application& app)
|
Application& app)
|
||||||
@@ -47,6 +45,7 @@ LedgerHistory::LedgerHistory(
|
|||||||
std::chrono::minutes{5},
|
std::chrono::minutes{5},
|
||||||
stopwatch(),
|
stopwatch(),
|
||||||
app_.journal("TaggedCache"))
|
app_.journal("TaggedCache"))
|
||||||
|
, mLedgersByIndex(512)
|
||||||
, j_(app.journal("LedgerHistory"))
|
, j_(app.journal("LedgerHistory"))
|
||||||
{
|
{
|
||||||
}
|
}
|
||||||
@@ -63,8 +62,6 @@ LedgerHistory::insert(
|
|||||||
ledger->stateMap().getHash().isNonZero(),
|
ledger->stateMap().getHash().isNonZero(),
|
||||||
"ripple::LedgerHistory::insert : nonzero hash");
|
"ripple::LedgerHistory::insert : nonzero hash");
|
||||||
|
|
||||||
std::unique_lock sl(m_ledgers_by_hash.peekMutex());
|
|
||||||
|
|
||||||
bool const alreadyHad = m_ledgers_by_hash.canonicalize_replace_cache(
|
bool const alreadyHad = m_ledgers_by_hash.canonicalize_replace_cache(
|
||||||
ledger->info().hash, ledger);
|
ledger->info().hash, ledger);
|
||||||
if (validated)
|
if (validated)
|
||||||
@@ -76,26 +73,19 @@ LedgerHistory::insert(
|
|||||||
LedgerHash
|
LedgerHash
|
||||||
LedgerHistory::getLedgerHash(LedgerIndex index)
|
LedgerHistory::getLedgerHash(LedgerIndex index)
|
||||||
{
|
{
|
||||||
std::unique_lock sl(m_ledgers_by_hash.peekMutex());
|
if (auto p = mLedgersByIndex.get(index))
|
||||||
if (auto it = mLedgersByIndex.find(index); it != mLedgersByIndex.end())
|
return *p;
|
||||||
return it->second;
|
|
||||||
return {};
|
return {};
|
||||||
}
|
}
|
||||||
|
|
||||||
std::shared_ptr<Ledger const>
|
std::shared_ptr<Ledger const>
|
||||||
LedgerHistory::getLedgerBySeq(LedgerIndex index)
|
LedgerHistory::getLedgerBySeq(LedgerIndex index)
|
||||||
{
|
{
|
||||||
|
if (auto p = mLedgersByIndex.get(index))
|
||||||
{
|
{
|
||||||
std::unique_lock sl(m_ledgers_by_hash.peekMutex());
|
uint256 const hash = *p;
|
||||||
auto it = mLedgersByIndex.find(index);
|
|
||||||
|
|
||||||
if (it != mLedgersByIndex.end())
|
|
||||||
{
|
|
||||||
uint256 hash = it->second;
|
|
||||||
sl.unlock();
|
|
||||||
return getLedgerByHash(hash);
|
return getLedgerByHash(hash);
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
std::shared_ptr<Ledger const> ret = loadByIndex(index, app_);
|
std::shared_ptr<Ledger const> ret = loadByIndex(index, app_);
|
||||||
|
|
||||||
@@ -108,8 +98,6 @@ LedgerHistory::getLedgerBySeq(LedgerIndex index)
|
|||||||
|
|
||||||
{
|
{
|
||||||
// Add this ledger to the local tracking by index
|
// Add this ledger to the local tracking by index
|
||||||
std::unique_lock sl(m_ledgers_by_hash.peekMutex());
|
|
||||||
|
|
||||||
XRPL_ASSERT(
|
XRPL_ASSERT(
|
||||||
ret->isImmutable(),
|
ret->isImmutable(),
|
||||||
"ripple::LedgerHistory::getLedgerBySeq : immutable result ledger");
|
"ripple::LedgerHistory::getLedgerBySeq : immutable result ledger");
|
||||||
@@ -458,8 +446,6 @@ LedgerHistory::builtLedger(
|
|||||||
XRPL_ASSERT(
|
XRPL_ASSERT(
|
||||||
!hash.isZero(), "ripple::LedgerHistory::builtLedger : nonzero hash");
|
!hash.isZero(), "ripple::LedgerHistory::builtLedger : nonzero hash");
|
||||||
|
|
||||||
std::unique_lock sl(m_consensus_validated.peekMutex());
|
|
||||||
|
|
||||||
auto entry = std::make_shared<cv_entry>();
|
auto entry = std::make_shared<cv_entry>();
|
||||||
m_consensus_validated.canonicalize_replace_client(index, entry);
|
m_consensus_validated.canonicalize_replace_client(index, entry);
|
||||||
|
|
||||||
@@ -500,8 +486,6 @@ LedgerHistory::validatedLedger(
|
|||||||
!hash.isZero(),
|
!hash.isZero(),
|
||||||
"ripple::LedgerHistory::validatedLedger : nonzero hash");
|
"ripple::LedgerHistory::validatedLedger : nonzero hash");
|
||||||
|
|
||||||
std::unique_lock sl(m_consensus_validated.peekMutex());
|
|
||||||
|
|
||||||
auto entry = std::make_shared<cv_entry>();
|
auto entry = std::make_shared<cv_entry>();
|
||||||
m_consensus_validated.canonicalize_replace_client(index, entry);
|
m_consensus_validated.canonicalize_replace_client(index, entry);
|
||||||
|
|
||||||
@@ -535,14 +519,14 @@ LedgerHistory::validatedLedger(
|
|||||||
bool
|
bool
|
||||||
LedgerHistory::fixIndex(LedgerIndex ledgerIndex, LedgerHash const& ledgerHash)
|
LedgerHistory::fixIndex(LedgerIndex ledgerIndex, LedgerHash const& ledgerHash)
|
||||||
{
|
{
|
||||||
std::unique_lock sl(m_ledgers_by_hash.peekMutex());
|
if (auto cur = mLedgersByIndex.get(ledgerIndex))
|
||||||
auto it = mLedgersByIndex.find(ledgerIndex);
|
|
||||||
|
|
||||||
if ((it != mLedgersByIndex.end()) && (it->second != ledgerHash))
|
|
||||||
{
|
{
|
||||||
it->second = ledgerHash;
|
if (*cur != ledgerHash)
|
||||||
|
{
|
||||||
|
mLedgersByIndex.put(ledgerIndex, ledgerHash);
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -556,11 +540,9 @@ LedgerHistory::clearLedgerCachePrior(LedgerIndex seq)
|
|||||||
m_ledgers_by_hash.del(it, false);
|
m_ledgers_by_hash.del(it, false);
|
||||||
}
|
}
|
||||||
|
|
||||||
std::unique_lock sl(m_ledgers_by_hash.peekMutex());
|
|
||||||
JLOG(j_.debug()) << "mLedgersByIndex size before clear: "
|
JLOG(j_.debug()) << "mLedgersByIndex size before clear: "
|
||||||
<< mLedgersByIndex.size();
|
<< mLedgersByIndex.size();
|
||||||
auto first_keep = mLedgersByIndex.lower_bound(seq);
|
mLedgersByIndex.eraseBefore(seq);
|
||||||
mLedgersByIndex.erase(mLedgersByIndex.begin(), first_keep);
|
|
||||||
JLOG(j_.debug()) << "mLedgersByIndex size after clear: "
|
JLOG(j_.debug()) << "mLedgersByIndex size after clear: "
|
||||||
<< mLedgersByIndex.size();
|
<< mLedgersByIndex.size();
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -22,6 +22,7 @@
|
|||||||
|
|
||||||
#include <xrpld/app/ledger/Ledger.h>
|
#include <xrpld/app/ledger/Ledger.h>
|
||||||
#include <xrpld/app/main/Application.h>
|
#include <xrpld/app/main/Application.h>
|
||||||
|
#include <xrpld/core/detail/LedgerIndexMap.h>
|
||||||
|
|
||||||
#include <xrpl/beast/insight/Collector.h>
|
#include <xrpl/beast/insight/Collector.h>
|
||||||
#include <xrpl/protocol/RippleLedgerHash.h>
|
#include <xrpl/protocol/RippleLedgerHash.h>
|
||||||
@@ -149,7 +150,8 @@ private:
|
|||||||
ConsensusValidated m_consensus_validated;
|
ConsensusValidated m_consensus_validated;
|
||||||
|
|
||||||
// Maps ledger indexes to the corresponding hash.
|
// Maps ledger indexes to the corresponding hash.
|
||||||
std::map<LedgerIndex, LedgerHash> mLedgersByIndex; // validated ledgers
|
ripple::LedgerIndexMap<LedgerIndex, LedgerHash>
|
||||||
|
mLedgersByIndex; // validated ledgers
|
||||||
|
|
||||||
beast::Journal j_;
|
beast::Journal j_;
|
||||||
};
|
};
|
||||||
|
|||||||
154
src/xrpld/core/detail/LedgerIndexMap.h
Normal file
154
src/xrpld/core/detail/LedgerIndexMap.h
Normal file
@@ -0,0 +1,154 @@
|
|||||||
|
//------------------------------------------------------------------------------
|
||||||
|
/*
|
||||||
|
This file is part of rippled: https://github.com/ripple/rippled
|
||||||
|
Copyright (c) 2012, 2013 Ripple Labs Inc.
|
||||||
|
|
||||||
|
Permission to use, copy, modify, and/or distribute this software for any
|
||||||
|
purpose with or without fee is hereby granted, provided that the above
|
||||||
|
copyright notice and this permission notice appear in all copies.
|
||||||
|
|
||||||
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
||||||
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
||||||
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
||||||
|
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
||||||
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
||||||
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
||||||
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
||||||
|
*/
|
||||||
|
//==============================================================================
|
||||||
|
|
||||||
|
#ifndef RIPPLE_APP_LEDGER_INDEX_MAP_H_INCLUDED
|
||||||
|
#define RIPPLE_APP_LEDGER_INDEX_MAP_H_INCLUDED
|
||||||
|
|
||||||
|
#include <mutex>
|
||||||
|
#include <queue>
|
||||||
|
#include <unordered_map>
|
||||||
|
|
||||||
|
namespace ripple {
|
||||||
|
|
||||||
|
template <class Key, class Mapped>
|
||||||
|
class LedgerIndexMap
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
LedgerIndexMap() = default;
|
||||||
|
explicit LedgerIndexMap(std::size_t reserve_capacity)
|
||||||
|
{
|
||||||
|
data_.reserve(reserve_capacity);
|
||||||
|
}
|
||||||
|
|
||||||
|
LedgerIndexMap(LedgerIndexMap const&) = delete;
|
||||||
|
LedgerIndexMap&
|
||||||
|
operator=(LedgerIndexMap const&) = delete;
|
||||||
|
LedgerIndexMap(LedgerIndexMap&&) = delete;
|
||||||
|
LedgerIndexMap&
|
||||||
|
operator=(LedgerIndexMap&&) = delete;
|
||||||
|
|
||||||
|
Mapped&
|
||||||
|
operator[](Key const& k)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
auto [it, inserted] = data_.try_emplace(k);
|
||||||
|
if (inserted)
|
||||||
|
order_.push(k);
|
||||||
|
return it->second;
|
||||||
|
}
|
||||||
|
|
||||||
|
Mapped&
|
||||||
|
operator[](Key&& k)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
auto [it, inserted] = data_.try_emplace(std::move(k));
|
||||||
|
if (inserted)
|
||||||
|
order_.push(it->first);
|
||||||
|
return it->second;
|
||||||
|
}
|
||||||
|
|
||||||
|
[[nodiscard]] Mapped*
|
||||||
|
get(Key const& k)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
auto it = data_.find(k);
|
||||||
|
return it == data_.end() ? nullptr : &it->second;
|
||||||
|
}
|
||||||
|
|
||||||
|
[[nodiscard]] Mapped const*
|
||||||
|
get(LedgerIndex const& k) const
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
auto it = data_.find(k);
|
||||||
|
return it == data_.end() ? nullptr : &it->second;
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class... Args>
|
||||||
|
Mapped&
|
||||||
|
put(Key const& k, Args&&... args)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
auto [it, inserted] = data_.try_emplace(k, std::forward<Args>(args)...);
|
||||||
|
if (!inserted)
|
||||||
|
it->second = Mapped(std::forward<Args>(args)...);
|
||||||
|
else
|
||||||
|
order_.push(k);
|
||||||
|
return it->second;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool
|
||||||
|
contains(Key const& k) const
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
return data_.find(k) != data_.end();
|
||||||
|
}
|
||||||
|
|
||||||
|
std::size_t
|
||||||
|
size() const noexcept
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
return data_.size();
|
||||||
|
}
|
||||||
|
|
||||||
|
bool
|
||||||
|
empty() const noexcept
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
return data_.empty();
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
reserve(std::size_t n)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
data_.reserve(n);
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
rehash(std::size_t n)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
data_.rehash(n);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::size_t
|
||||||
|
eraseBefore(Key const& cutoff)
|
||||||
|
{
|
||||||
|
std::lock_guard lock(mutex_);
|
||||||
|
std::size_t removed = 0;
|
||||||
|
while (!order_.empty())
|
||||||
|
{
|
||||||
|
Key const& k = order_.front();
|
||||||
|
if (!(k < cutoff))
|
||||||
|
break;
|
||||||
|
removed += (data_.erase(k) != 0);
|
||||||
|
order_.pop();
|
||||||
|
}
|
||||||
|
return removed;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
std::unordered_map<Key, Mapped> data_;
|
||||||
|
std::queue<Key> order_; // assumes non-decreasing inserts for O(k) purge
|
||||||
|
mutable std::mutex mutex_;
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace ripple
|
||||||
|
|
||||||
|
#endif // RIPPLE_APP_LEDGER_INDEX_MAP_H_INCLUDED
|
||||||
Reference in New Issue
Block a user