Introduce merkle tree implementation #11
There are no files selected for viewing
This file contains hidden or 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,2 @@ | ||
| CompileFlags: | ||
| Add: [-D__cpp_concepts=202002L] |
This file contains hidden or 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 hidden or 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 hidden or 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 hidden or 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 hidden or 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 hidden or 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 hidden or 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,3 @@ | ||
|
|
||
| add_executable(set_get_benchmark merkle_tree/set_get.cpp) | ||
| target_link_libraries(set_get_benchmark benchmark::benchmark merkle_tree) |
This file contains hidden or 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,127 @@ | ||
| #include <cstddef> | ||
| #include <expected> | ||
| #include <filesystem> | ||
| #include <memory> | ||
| #include <optional> | ||
| #include <random> | ||
| #include <ranges> | ||
| #include <string> | ||
| #include <utility> | ||
| #include <vector> | ||
|
|
||
| #include <benchmark/benchmark.h> | ||
| #include <client/TracyScoped.hpp> | ||
| #include <tracy/Tracy.hpp> | ||
|
|
||
| #include <morum/archive_backend.hpp> | ||
| #include <morum/common.hpp> | ||
| #include <morum/db.hpp> | ||
| #include <morum/merkle_tree.hpp> | ||
|
|
||
| constexpr unsigned seed = 42; | ||
| static std::mt19937_64 rand_engine{seed}; | ||
|
|
||
| template <std::ranges::input_range R> | ||
| void fill_random(R &&span) { | ||
| static std::uniform_int_distribution dist; | ||
Harrm marked this conversation as resolved.
Outdated
Show resolved
Hide resolved
|
||
|
|
||
| for (auto &byte : span) { | ||
| byte = dist(rand_engine); | ||
| } | ||
| } | ||
|
|
||
| morum::Hash32 random_hash() { | ||
| morum::Hash32 hash; | ||
| fill_random(hash); | ||
| return hash; | ||
| } | ||
|
|
||
| qtils::ByteVec random_vector(size_t min_size = 1, size_t max_size = 128) { | ||
| std::uniform_int_distribution<size_t> dist(min_size, max_size); | ||
| size_t size = dist(rand_engine); | ||
|
|
||
| qtils::ByteVec v(size); | ||
| fill_random(v); | ||
| return v; | ||
| } | ||
|
|
||
| std::unique_ptr<morum::ArchiveTrieDb> trie_db; | ||
| morum::Hash32 last_root{}; | ||
|
|
||
| static void BM_SetGet(benchmark::State &state) { | ||
| rand_engine.seed(42); | ||
| constexpr int INSERTION_NUM = 1000; | ||
|
|
||
| for (auto _ : state) { | ||
| ZoneNamedN(loop_zone, "loop", true); | ||
|
|
||
| auto tree = trie_db->load_tree(last_root).value().value(); | ||
|
|
||
| std::vector<std::pair<morum::Hash32, qtils::ByteVec>> insertions; | ||
| for (int i = 0; i < INSERTION_NUM; i++) { | ||
| insertions.emplace_back(random_hash(), random_vector()); | ||
| } | ||
| { | ||
| ZoneNamedN(setter_zone, "set", true); | ||
| for (auto &[k, v] : insertions) { | ||
| tree->set(k, qtils::ByteVec{v}).value(); | ||
|
Contributor
There was a problem hiding this comment. Возможно тут стоит вставить ассерт на наличие результата
Author
There was a problem hiding this comment. It will throw an exception and kill the benchmark, which in this place works fine in my opinion. |
||
| } | ||
| } | ||
| { | ||
| ZoneNamedN(getter_zone, "get", true); | ||
|
|
||
| for (auto &[k, v] : insertions) { | ||
| tree->get(k).value(); | ||
|
Contributor
There was a problem hiding this comment. Возможно тут стоит вставить ассерт на наличие результата
Author
There was a problem hiding this comment. It will throw an exception and kill the benchmark, which in this place works fine in my opinion. |
||
| } | ||
| } | ||
| { | ||
| ZoneNamedN(calculate_hash_zone, "calculate_hash", true); | ||
| trie_db->get_root_and_store(*tree).value(); | ||
| } | ||
|
|
||
| FrameMark; | ||
| } | ||
| } | ||
|
|
||
| BENCHMARK(BM_SetGet); | ||
|
|
||
| template <typename F> | ||
| struct FinalAction { | ||
Harrm marked this conversation as resolved.
Outdated
Show resolved
Hide resolved
|
||
| ~FinalAction() { | ||
| f(); | ||
| } | ||
|
|
||
| F f; | ||
| }; | ||
|
|
||
| int main(int argc, char **argv) { | ||
| char arg0_default[] = "benchmark"; | ||
| char *args_default = arg0_default; | ||
| if (!argv) { | ||
|
||
| argc = 1; | ||
| argv = &args_default; | ||
| } | ||
|
|
||
| auto db = std::shared_ptr{morum::open_db("./test_db").value()}; | ||
| FinalAction cleanup{[]() { std::filesystem::remove_all("./test_db"); }}; | ||
|
|
||
| trie_db = std::make_unique<morum::ArchiveTrieDb>(db); | ||
|
|
||
| auto tree = trie_db->empty_tree(); | ||
| constexpr int INSERTION_NUM = 5000; | ||
| { | ||
| ZoneNamedN(setter_zone, "initial insertions", true); | ||
|
|
||
| for (int i = 0; i < INSERTION_NUM; i++) { | ||
| tree->set(random_hash(), qtils::ByteVec{random_vector()}).value(); | ||
|
Contributor
There was a problem hiding this comment. Возможно тут стоит вставить ассерт на наличие результата
Author
There was a problem hiding this comment. It will throw an exception and kill the benchmark, which in this place works fine in my opinion. |
||
| } | ||
| } | ||
| last_root = trie_db->get_root_and_store(*tree).value(); | ||
| ::benchmark::Initialize(&argc, argv); | ||
| if (::benchmark::ReportUnrecognizedArguments(argc, argv)) { | ||
| return 1; | ||
| } | ||
| ::benchmark::RunSpecifiedBenchmarks(); | ||
| ::benchmark::Shutdown(); | ||
| return 0; | ||
| } | ||
This file contains hidden or 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 |
|---|---|---|
|
|
@@ -22,7 +22,7 @@ logging: | |
| level: trace | ||
| is_fallback: true | ||
| children: | ||
| - name: morum | ||
| children: | ||
| - name: modules | ||
| children: | ||
|
|
||
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.
Uh oh!
There was an error while loading. Please reload this page.