ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2026-09-27 23:38:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

test: Propagate finalize's fatal failure to the calling test

Browse Source 
A gtest ASSERT_ aborts only the function it appears in, so the
ASSERT_FALSE inside the finalize helper returned from finalize while the
calling test carried on with an unhashed map. The failure was still
recorded, but the test then failed again further down on assertions that
only depended on the map being hashed, burying the real cause.

Wraps all six call sites in ASSERT_NO_FATAL_FAILURE, which is the
mechanism gtest documents for propagating a subroutine's fatal failure,
and notes the requirement on the helper itself.
This commit is contained in:
Bart
2026-09-02 13:40:36 -04:00
parent a934aa381e
commit 00695d8b1a
1 changed files with 10 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
src/tests/libxrpl/shamap/SHAMapSync.cpp
View File

@@ -193,6 +193,10 @@ TEST_F(SHAMapSyncTest, sync)
// Node hashes are computed on demand, and `visitDifferences` returns early while the root hash is
// still zero, so a map has to be hashed before it can be compared against another.
//
// The ASSERT_ below aborts only this helper, not the calling test, so every call site wraps it in
// ASSERT_NO_FATAL_FAILURE. Without that the test would carry on with an unhashed map and fail again
// further down, burying the real cause.
static void
finalize(SHAMap& map)
{
@@ -221,7 +225,7 @@ TEST_F(SHAMapSyncTest, visit_differences_reports_only_what_is_missing)
{
ASSERT_TRUE(have.addItem(SHAMapNodeType::TnAccountState, item));
}
finalize(have);
ASSERT_NO_FATAL_FAILURE(finalize(have));
SHAMap want{SHAMapType::FREE, f};
for (auto const& item : shared)
@@ -229,7 +233,7 @@ TEST_F(SHAMapSyncTest, visit_differences_reports_only_what_is_missing)
ASSERT_TRUE(want.addItem(SHAMapNodeType::TnAccountState, item));
}
ASSERT_TRUE(want.addItem(SHAMapNodeType::TnAccountState, extra));
finalize(want);
ASSERT_NO_FATAL_FAILURE(finalize(want));
std::vector<uint256> leaves;
std::size_t inners = 0;
@@ -270,11 +274,11 @@ TEST_F(SHAMapSyncTest, visit_differences_against_identical_map_reports_nothing)
SHAMap have{SHAMapType::FREE, f};
ASSERT_TRUE(have.addItem(SHAMapNodeType::TnAccountState, item));
finalize(have);
ASSERT_NO_FATAL_FAILURE(finalize(have));
SHAMap want{SHAMapType::FREE, f};
ASSERT_TRUE(want.addItem(SHAMapNodeType::TnAccountState, item));
finalize(want);
ASSERT_NO_FATAL_FAILURE(finalize(want));
ASSERT_EQ(want.getHash(), have.getHash());
std::size_t visited = 0;
@@ -295,7 +299,7 @@ TEST_F(SHAMapSyncTest, visit_differences_against_no_map_reports_every_node)
{
ASSERT_TRUE(want.addItem(SHAMapNodeType::TnAccountState, makeRandomAS()));
}
finalize(want);
ASSERT_NO_FATAL_FAILURE(finalize(want));
// A null `have` means the far side holds nothing, so every node counts as missing. Compared
// against visitNodes, which walks the same tree with no such filtering.
@@ -324,7 +328,7 @@ TEST_F(SHAMapSyncTest, visit_differences_stops_when_callback_returns_false)
{
ASSERT_TRUE(want.addItem(SHAMapNodeType::TnAccountState, makeRandomAS()));
}
finalize(want);
ASSERT_NO_FATAL_FAILURE(finalize(want));
// Returning false is how populateFetchPack stops once the pack is full, so the walk must
// honour it rather than visiting the rest of the tree.