Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Do not attempt to acquire missing data from peer network in #4458

Merged
merged 1 commit into from
Mar 15, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/ripple/app/ledger/Ledger.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -266,7 +266,7 @@ Ledger::Ledger(
{
info_.hash = calculateLedgerHash(info_);
if (acquire && !config.reporting())
family.missingNode(info_.hash, info_.seq);
family.missingNodeAcquireByHash(info_.hash, info_.seq);
}
}

Expand Down
16 changes: 14 additions & 2 deletions src/ripple/shamap/Family.h
Original file line number Diff line number Diff line change
Expand Up @@ -75,11 +75,23 @@ class Family
virtual bool
isShardBacked() const = 0;

/** Acquire ledger that has a missing node by ledger sequence
*
* Throw if in reporting mode.
*
* @param refNum Sequence of ledger to acquire.
* @param nodeHash Hash of missing node to report in throw.
*/
virtual void
missingNode(std::uint32_t refNum) = 0;
missingNodeAcquireBySeq(std::uint32_t refNum, uint256 const& nodeHash) = 0;

/** Acquire ledger that has a missing node by ledger hash
*
* @param refHash Hash of ledger to acquire.
* @param refNum Ledger sequence with missing node.
*/
virtual void
missingNode(uint256 const& refHash, std::uint32_t refNum) = 0;
missingNodeAcquireByHash(uint256 const& refHash, std::uint32_t refNum) = 0;

virtual void
reset() = 0;
Expand Down
4 changes: 2 additions & 2 deletions src/ripple/shamap/NodeFamily.h
Original file line number Diff line number Diff line change
Expand Up @@ -83,10 +83,10 @@ class NodeFamily : public Family
reset() override;

void
missingNode(std::uint32_t seq) override;
missingNodeAcquireBySeq(std::uint32_t seq, uint256 const& hash) override;

void
missingNode(uint256 const& hash, std::uint32_t seq) override
missingNodeAcquireByHash(uint256 const& hash, std::uint32_t seq) override
{
acquire(hash, seq);
}
Expand Down
5 changes: 3 additions & 2 deletions src/ripple/shamap/ShardFamily.h
Original file line number Diff line number Diff line change
Expand Up @@ -89,10 +89,11 @@ class ShardFamily : public Family
reset() override;

void
missingNode(std::uint32_t seq) override;
missingNodeAcquireBySeq(std::uint32_t seq, uint256 const& nodeHash)
override;

void
missingNode(uint256 const& hash, std::uint32_t seq) override
missingNodeAcquireByHash(uint256 const& hash, std::uint32_t seq) override
{
acquire(hash, seq);
}
Expand Down
10 changes: 9 additions & 1 deletion src/ripple/shamap/impl/NodeFamily.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -21,6 +21,7 @@
#include <ripple/app/main/Application.h>
#include <ripple/app/main/Tuning.h>
#include <ripple/shamap/NodeFamily.h>
#include <sstream>

namespace ripple {

Expand Down Expand Up @@ -65,9 +66,16 @@ NodeFamily::reset()
}

void
NodeFamily::missingNode(std::uint32_t seq)
NodeFamily::missingNodeAcquireBySeq(std::uint32_t seq, uint256 const& nodeHash)
{
JLOG(j_.error()) << "Missing node in " << seq;
if (app_.config().reporting())
{
std::stringstream ss;
ss << "Node not read, likely a Cassandra error in ledger seq " << seq
<< " object hash " << nodeHash;
Throw<std::runtime_error>(ss.str());
}

std::unique_lock<std::mutex> lock(maxSeqMutex_);
if (maxSeq_ == 0)
Expand Down
32 changes: 21 additions & 11 deletions src/ripple/shamap/impl/SHAMap.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -173,30 +173,40 @@ SHAMap::finishFetch(
std::shared_ptr<NodeObject> const& object) const
{
assert(backed_);
if (!object)
{
if (full_)
{
full_ = false;
f_.missingNode(ledgerSeq_);
}
return {};
}

std::shared_ptr<SHAMapTreeNode> node;
try
{
if (!object)
{
if (full_)
{
full_ = false;
f_.missingNodeAcquireBySeq(ledgerSeq_, hash.as_uint256());
}
return {};
}

node =
SHAMapTreeNode::makeFromPrefix(makeSlice(object->getData()), hash);
if (node)
canonicalize(hash, node);
return node;
}
catch (std::exception const&)
catch (SHAMapMissingNode const& e)
{
JLOG(journal_.warn()) << "Missing node: " << hash << " : " << e.what();
}
catch (std::runtime_error const& e)
{
JLOG(journal_.warn()) << e.what();
}
catch (...)
{
JLOG(journal_.warn()) << "Invalid DB node " << hash;
return std::shared_ptr<SHAMapTreeNode>();
}

return std::shared_ptr<SHAMapTreeNode>();
}

// See if a sync filter has a node
Expand Down
4 changes: 3 additions & 1 deletion src/ripple/shamap/impl/ShardFamily.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,7 @@
#include <ripple/app/main/Tuning.h>
#include <ripple/nodestore/DatabaseShard.h>
#include <ripple/shamap/ShardFamily.h>
#include <tuple>

namespace ripple {

Expand Down Expand Up @@ -152,8 +153,9 @@ ShardFamily::reset()
}

void
ShardFamily::missingNode(std::uint32_t seq)
ShardFamily::missingNodeAcquireBySeq(std::uint32_t seq, uint256 const& nodeHash)
{
std::ignore = nodeHash;
JLOG(j_.error()) << "Missing node in ledger sequence " << seq;

std::unique_lock<std::mutex> lock(maxSeqMutex_);
Expand Down
6 changes: 4 additions & 2 deletions src/test/shamap/common.h
Original file line number Diff line number Diff line change
Expand Up @@ -105,13 +105,15 @@ class TestNodeFamily : public Family
}

void
missingNode(std::uint32_t refNum) override
missingNodeAcquireBySeq(std::uint32_t refNum, uint256 const& nodeHash)
override
{
Throw<std::runtime_error>("missing node");
}

void
missingNode(uint256 const& refHash, std::uint32_t refNum) override
missingNodeAcquireByHash(uint256 const& refHash, std::uint32_t refNum)
override
{
Throw<std::runtime_error>("missing node");
}
Expand Down