-
Notifications
You must be signed in to change notification settings - Fork 785
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
Database scan improvements #4734
Merged
pwojcikdev
merged 4 commits into
nanocurrency:develop
from
pwojcikdev:database-scan-improvements
Sep 30, 2024
Merged
Changes from 3 commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,165 @@ | ||
#include <nano/lib/utility.hpp> | ||
#include <nano/node/bootstrap_ascending/database_scan.hpp> | ||
#include <nano/secure/common.hpp> | ||
#include <nano/secure/ledger.hpp> | ||
#include <nano/secure/ledger_set_any.hpp> | ||
#include <nano/store/account.hpp> | ||
#include <nano/store/component.hpp> | ||
#include <nano/store/pending.hpp> | ||
|
||
/* | ||
* database_scan | ||
*/ | ||
|
||
nano::bootstrap_ascending::database_scan::database_scan (nano::ledger & ledger_a) : | ||
ledger{ ledger_a }, | ||
accounts_iterator{ ledger }, | ||
pending_iterator{ ledger } | ||
{ | ||
} | ||
|
||
nano::account nano::bootstrap_ascending::database_scan::next (std::function<bool (nano::account const &)> const & filter) | ||
{ | ||
if (queue.empty ()) | ||
{ | ||
fill (); | ||
} | ||
|
||
while (!queue.empty ()) | ||
{ | ||
auto result = queue.front (); | ||
queue.pop_front (); | ||
|
||
if (filter (result)) | ||
{ | ||
return result; | ||
} | ||
} | ||
|
||
return { 0 }; | ||
} | ||
|
||
void nano::bootstrap_ascending::database_scan::fill () | ||
{ | ||
auto transaction = ledger.store.tx_begin_read (); | ||
|
||
auto set1 = accounts_iterator.next_batch (transaction, batch_size); | ||
auto set2 = pending_iterator.next_batch (transaction, batch_size); | ||
|
||
queue.insert (queue.end (), set1.begin (), set1.end ()); | ||
queue.insert (queue.end (), set2.begin (), set2.end ()); | ||
} | ||
|
||
bool nano::bootstrap_ascending::database_scan::warmed_up () const | ||
{ | ||
return accounts_iterator.warmed_up () && pending_iterator.warmed_up (); | ||
} | ||
|
||
std::unique_ptr<nano::container_info_component> nano::bootstrap_ascending::database_scan::collect_container_info (std::string const & name) const | ||
{ | ||
auto composite = std::make_unique<container_info_composite> (name); | ||
composite->add_component (std::make_unique<container_info_leaf> (container_info{ "accounts_iterator", accounts_iterator.completed, 0 })); | ||
composite->add_component (std::make_unique<container_info_leaf> (container_info{ "pending_iterator", pending_iterator.completed, 0 })); | ||
return composite; | ||
} | ||
|
||
/* | ||
* account_database_iterator | ||
*/ | ||
|
||
nano::bootstrap_ascending::account_database_iterator::account_database_iterator (nano::ledger & ledger_a) : | ||
ledger{ ledger_a } | ||
{ | ||
} | ||
|
||
std::deque<nano::account> nano::bootstrap_ascending::account_database_iterator::next_batch (nano::store::transaction & transaction, size_t batch_size) | ||
{ | ||
std::deque<nano::account> result; | ||
|
||
auto it = ledger.store.account.begin (transaction, next); | ||
auto const end = ledger.store.account.end (); | ||
|
||
for (size_t count = 0; it != end && count < batch_size; ++it, ++count) | ||
{ | ||
auto const & account = it->first; | ||
result.push_back (account); | ||
next = account.number () + 1; | ||
} | ||
|
||
if (it == end) | ||
{ | ||
// Reset for the next ledger iteration | ||
next = { 0 }; | ||
++completed; | ||
} | ||
|
||
return result; | ||
} | ||
|
||
bool nano::bootstrap_ascending::account_database_iterator::warmed_up () const | ||
{ | ||
return completed > 0; | ||
} | ||
|
||
/* | ||
* pending_database_iterator | ||
*/ | ||
|
||
nano::bootstrap_ascending::pending_database_iterator::pending_database_iterator (nano::ledger & ledger_a) : | ||
ledger{ ledger_a } | ||
{ | ||
} | ||
|
||
std::deque<nano::account> nano::bootstrap_ascending::pending_database_iterator::next_batch (nano::store::transaction & transaction, size_t batch_size) | ||
{ | ||
std::deque<nano::account> result; | ||
|
||
auto it = ledger.store.pending.begin (transaction, next); | ||
auto const end = ledger.store.pending.end (); | ||
|
||
// TODO: This pending iteration heuristic should be encapsulated in a pending_iterator class and reused across other components | ||
auto advance_iterator = [&] () { | ||
auto const starting_account = it->first.account; | ||
|
||
// For RocksDB, sequential access is ~10x faster than performing a fresh lookup (tested on my machine) | ||
const size_t sequential_attempts = 10; | ||
|
||
// First try advancing sequentially | ||
for (size_t count = 0; count < sequential_attempts && it != end; ++count, ++it) | ||
{ | ||
if (it->first.account != starting_account) | ||
{ | ||
break; | ||
} | ||
} | ||
|
||
// If we didn't advance to the next account, perform a fresh lookup | ||
if (it != end && it->first.account != starting_account) | ||
{ | ||
it = ledger.store.pending.begin (transaction, { starting_account.number () + 1, 0 }); | ||
} | ||
|
||
debug_assert (it == end || it->first.account != starting_account); | ||
}; | ||
|
||
for (size_t count = 0; it != end && count < batch_size; advance_iterator (), ++count) | ||
{ | ||
auto const & account = it->first.account; | ||
result.push_back (account); | ||
next = { account.number () + 1, 0 }; | ||
} | ||
|
||
if (it == end) | ||
{ | ||
// Reset for the next ledger iteration | ||
next = { 0, 0 }; | ||
++completed; | ||
} | ||
|
||
return result; | ||
} | ||
|
||
bool nano::bootstrap_ascending::pending_database_iterator::warmed_up () const | ||
{ | ||
return completed > 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
#pragma once | ||
|
||
#include <nano/lib/numbers.hpp> | ||
#include <nano/node/fwd.hpp> | ||
#include <nano/secure/pending_info.hpp> | ||
|
||
#include <deque> | ||
|
||
namespace nano::bootstrap_ascending | ||
{ | ||
struct account_database_iterator | ||
{ | ||
explicit account_database_iterator (nano::ledger &); | ||
|
||
std::deque<nano::account> next_batch (nano::store::transaction &, size_t batch_size); | ||
bool warmed_up () const; | ||
|
||
nano::ledger & ledger; | ||
nano::account next{ 0 }; | ||
size_t completed{ 0 }; | ||
}; | ||
|
||
struct pending_database_iterator | ||
{ | ||
explicit pending_database_iterator (nano::ledger &); | ||
|
||
std::deque<nano::account> next_batch (nano::store::transaction &, size_t batch_size); | ||
bool warmed_up () const; | ||
|
||
nano::ledger & ledger; | ||
nano::pending_key next{ 0, 0 }; | ||
size_t completed{ 0 }; | ||
}; | ||
|
||
class database_scan | ||
{ | ||
public: | ||
explicit database_scan (nano::ledger &); | ||
|
||
nano::account next (std::function<bool (nano::account const &)> const & filter); | ||
|
||
// Indicates if a full ledger iteration has taken place e.g. warmed up | ||
bool warmed_up () const; | ||
|
||
std::unique_ptr<nano::container_info_component> collect_container_info (std::string const & name) const; | ||
|
||
private: // Dependencies | ||
nano::ledger & ledger; | ||
|
||
private: | ||
void fill (); | ||
|
||
private: | ||
account_database_iterator accounts_iterator; | ||
pending_database_iterator pending_iterator; | ||
|
||
std::deque<nano::account> queue; | ||
|
||
static size_t constexpr batch_size = 512; | ||
}; | ||
} |
This file was deleted.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is this heuristic used to skip accounts with a large number of pending entries? A comment on why using sequential scanning alone is insufficient would help.