-
Notifications
You must be signed in to change notification settings - Fork 21
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
87b40b0
commit abf385a
Showing
6 changed files
with
316 additions
and
39 deletions.
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
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,262 @@ | ||
/********************************************************************************* | ||
* Modifications Copyright 2017-2019 eBay Inc. | ||
* | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* You may obtain a copy of the License at | ||
* https://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software distributed | ||
* under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR | ||
* CONDITIONS OF ANY KIND, either express or implied. See the License for the | ||
* specific language governing permissions and limitations under the License. | ||
* | ||
*********************************************************************************/ | ||
|
||
#include <benchmark/benchmark.h> | ||
#include <boost/uuid/random_generator.hpp> | ||
#include <stdint.h> | ||
|
||
#include <iomgr/io_environment.hpp> | ||
#include <sisl/options/options.h> | ||
#include <homestore/homestore.hpp> | ||
#include <homestore/index/index_table.hpp> | ||
#include <homestore/btree/detail/btree_internal.hpp> | ||
#include "test_common/homestore_test_common.hpp" | ||
#include "btree_helpers/btree_test_kvs.hpp" | ||
#include "test_common/range_scheduler.hpp" | ||
#include "btree_helpers/btree_test_helper.hpp" | ||
|
||
using namespace homestore; | ||
|
||
#define CREATE_BENCHMARK_CASE(FUC) \ | ||
template < class BenchmarkType > \ | ||
void FUC(benchmark::State& state) { \ | ||
auto helper = GET_BENCHMARK_HELPER(BenchmarkType); \ | ||
for (auto _ : state) { \ | ||
helper->FUC(); \ | ||
} \ | ||
add_custom_counter< BenchmarkType >(state); \ | ||
} | ||
|
||
#define INDEX_BETREE_BENCHMARK(BTREE_TYPE) \ | ||
BENCHMARK(put< BTREE_TYPE >) \ | ||
->Setup(BM_Setup< BTREE_TYPE >) \ | ||
->Teardown(BM_Teardown< BTREE_TYPE >) \ | ||
->UseRealTime() \ | ||
->Iterations(1); \ | ||
BENCHMARK(remove< BTREE_TYPE >) \ | ||
->Setup(BM_SetupAndPreload< BTREE_TYPE >) \ | ||
->Teardown(BM_Teardown< BTREE_TYPE >) \ | ||
->UseRealTime() \ | ||
->Iterations(1); \ | ||
BENCHMARK(range_put< BTREE_TYPE >) \ | ||
->Setup(BM_SetupAndPreload< BTREE_TYPE >) \ | ||
->Teardown(BM_Teardown< BTREE_TYPE >) \ | ||
->UseRealTime() \ | ||
->Iterations(1); \ | ||
BENCHMARK(query< BTREE_TYPE >) \ | ||
->Setup(BM_SetupAndPreload< BTREE_TYPE >) \ | ||
->Teardown(BM_Teardown< BTREE_TYPE >) \ | ||
->UseRealTime() \ | ||
->Iterations(1); | ||
|
||
// this is used to splite the setup and teardown from the benchmark to get a more accurate result | ||
void* globle_helper{nullptr}; | ||
|
||
#define GET_BENCHMARK_HELPER(BTREE_TYPE) static_cast< IndexBtreeBenchmark< BTREE_TYPE >* >(globle_helper) | ||
|
||
SISL_LOGGING_INIT(HOMESTORE_LOG_MODS) | ||
std::vector< std::string > test_common::HSTestHelper::s_dev_names; | ||
SISL_OPTIONS_ENABLE(logging, index_btree_benchmark, iomgr, test_common_setup) | ||
|
||
SISL_OPTION_GROUP( | ||
index_btree_benchmark, | ||
(num_iters, "", "num_iters", "number of iterations for rand ops", | ||
::cxxopts::value< uint32_t >()->default_value("500"), "number"), | ||
(num_entries, "", "num_entries", "number of entries to test with", | ||
::cxxopts::value< uint32_t >()->default_value("5000"), "number"), | ||
(run_time, "", "run_time", "run time for io", ::cxxopts::value< uint32_t >()->default_value("360000"), "seconds"), | ||
(disable_merge, "", "disable_merge", "disable_merge", ::cxxopts::value< bool >()->default_value("0"), ""), | ||
(operation_list, "", "operation_list", "operation list instead of default created following by percentage", | ||
::cxxopts::value< std::vector< std::string > >(), "operations [...]"), | ||
(preload_size, "", "preload_size", "number of entries to preload tree with", | ||
::cxxopts::value< uint32_t >()->default_value("1000"), "number")) | ||
|
||
struct FixedLenBtree { | ||
using BtreeType = IndexTable< TestFixedKey, TestFixedValue >; | ||
using KeyType = TestFixedKey; | ||
using ValueType = TestFixedValue; | ||
static constexpr btree_node_type leaf_node_type = btree_node_type::FIXED; | ||
static constexpr btree_node_type interior_node_type = btree_node_type::FIXED; | ||
}; | ||
|
||
struct VarKeySizeBtree { | ||
using BtreeType = IndexTable< TestVarLenKey, TestFixedValue >; | ||
using KeyType = TestVarLenKey; | ||
using ValueType = TestFixedValue; | ||
static constexpr btree_node_type leaf_node_type = btree_node_type::VAR_KEY; | ||
static constexpr btree_node_type interior_node_type = btree_node_type::VAR_KEY; | ||
}; | ||
|
||
struct VarValueSizeBtree { | ||
using BtreeType = IndexTable< TestVarLenKey, TestVarLenValue >; | ||
using KeyType = TestVarLenKey; | ||
using ValueType = TestVarLenValue; | ||
static constexpr btree_node_type leaf_node_type = btree_node_type::VAR_OBJECT; | ||
static constexpr btree_node_type interior_node_type = btree_node_type::VAR_OBJECT; | ||
}; | ||
|
||
struct VarObjSizeBtree { | ||
using BtreeType = IndexTable< TestVarLenKey, TestVarLenValue >; | ||
using KeyType = TestVarLenKey; | ||
using ValueType = TestVarLenValue; | ||
static constexpr btree_node_type leaf_node_type = btree_node_type::VAR_OBJECT; | ||
static constexpr btree_node_type interior_node_type = btree_node_type::VAR_OBJECT; | ||
}; | ||
|
||
struct PrefixIntervalBtree { | ||
using BtreeType = IndexTable< TestIntervalKey, TestIntervalValue >; | ||
using KeyType = TestIntervalKey; | ||
using ValueType = TestIntervalValue; | ||
static constexpr btree_node_type leaf_node_type = btree_node_type::PREFIX; | ||
static constexpr btree_node_type interior_node_type = btree_node_type::FIXED; | ||
}; | ||
|
||
template < typename TestType > | ||
struct IndexBtreeBenchmark : public BtreeHelper< TestType > { | ||
using T = TestType; | ||
using K = typename TestType::KeyType; | ||
using V = typename TestType::ValueType; | ||
class TestIndexServiceCallbacks : public IndexServiceCallbacks { | ||
public: | ||
TestIndexServiceCallbacks(IndexBtreeBenchmark* test) : m_benchmark(test) {} | ||
std::shared_ptr< IndexTableBase > on_index_table_found(const superblk< index_table_sb >& sb) { | ||
LOGINFO("Index table recovered"); | ||
LOGINFO("Root bnode_id {} version {}", sb->root_node, sb->link_version); | ||
m_benchmark->m_bt = std::make_shared< typename T::BtreeType >(sb, m_benchmark->m_cfg); | ||
return m_benchmark->m_bt; | ||
} | ||
|
||
private: | ||
IndexBtreeBenchmark* m_benchmark; | ||
}; | ||
|
||
IndexBtreeBenchmark() { | ||
this->m_is_multi_threaded = true; | ||
SetUp(); | ||
} | ||
|
||
~IndexBtreeBenchmark() { TearDown(); } | ||
|
||
void SetUp() { | ||
test_common::HSTestHelper::start_homestore( | ||
"index_btree_benchmark", | ||
{{HS_SERVICE::META, {.size_pct = 10.0}}, | ||
{HS_SERVICE::INDEX, {.size_pct = 70.0, .index_svc_cbs = new TestIndexServiceCallbacks(this)}}}); | ||
|
||
this->m_cfg = BtreeConfig(hs()->index_service().node_size()); | ||
|
||
auto uuid = boost::uuids::random_generator()(); | ||
auto parent_uuid = boost::uuids::random_generator()(); | ||
|
||
BtreeHelper< TestType >::SetUp(); | ||
this->m_bt = std::make_shared< typename T::BtreeType >(uuid, parent_uuid, 0, this->m_cfg); | ||
hs()->index_service().add_index_table(this->m_bt); | ||
} | ||
|
||
void TearDown() { | ||
BtreeHelper< TestType >::TearDown(); | ||
test_common::HSTestHelper::shutdown_homestore(); | ||
} | ||
|
||
void ConcurrentOps(std::vector< std::string > input_ops) { | ||
std::vector< std::pair< std::string, int > > ops; | ||
if (SISL_OPTIONS.count("operation_list")) { | ||
input_ops = SISL_OPTIONS["operation_list"].as< std::vector< std::string > >(); | ||
} | ||
int total = std::accumulate(input_ops.begin(), input_ops.end(), 0, [](int sum, const auto& str) { | ||
std::vector< std::string > tokens; | ||
boost::split(tokens, str, boost::is_any_of(":")); | ||
if (tokens.size() == 2) { | ||
try { | ||
return sum + std::stoi(tokens[1]); | ||
} catch (const std::exception&) { | ||
// Invalid frequency, ignore this element | ||
} | ||
} | ||
return sum; // Ignore malformed strings | ||
}); | ||
|
||
std::transform(input_ops.begin(), input_ops.end(), std::back_inserter(ops), [total](const auto& str) { | ||
std::vector< std::string > tokens; | ||
boost::split(tokens, str, boost::is_any_of(":")); | ||
if (tokens.size() == 2) { | ||
try { | ||
return std::make_pair(tokens[0], (int)(100.0 * std::stoi(tokens[1]) / total)); | ||
} catch (const std::exception&) { | ||
// Invalid frequency, ignore this element | ||
} | ||
} | ||
return std::make_pair(std::string(), 0); | ||
}); | ||
|
||
this->run_in_parallel(ops); | ||
} | ||
|
||
void put() { this->ConcurrentOps({"put:100"}); } | ||
|
||
void remove() { this->ConcurrentOps({"remove:100"}); } | ||
|
||
void range_put() { this->ConcurrentOps({"range_put:100"}); } | ||
|
||
void query() { this->ConcurrentOps({"query:100"}); } | ||
}; | ||
|
||
template < class BenchmarkType > | ||
void BM_Setup(const benchmark::State& state) { | ||
globle_helper = new IndexBtreeBenchmark< BenchmarkType >(); | ||
} | ||
|
||
template < class BenchmarkType > | ||
void BM_SetupAndPreload(const benchmark::State& state) { | ||
BM_Setup< BenchmarkType >(state); | ||
auto helper = GET_BENCHMARK_HELPER(BenchmarkType); | ||
helper->preload(SISL_OPTIONS["preload_size"].as< uint32_t >()); | ||
} | ||
|
||
template < class BenchmarkType > | ||
void BM_Teardown(const benchmark::State& state) { | ||
delete GET_BENCHMARK_HELPER(BenchmarkType); | ||
} | ||
|
||
template < class BenchmarkType > | ||
void add_custom_counter(benchmark::State& state) { | ||
auto helper = GET_BENCHMARK_HELPER(BenchmarkType); | ||
auto totol_ops = helper->get_op_num(); | ||
state.counters["thread_num"] = SISL_OPTIONS["num_threads"].as< uint32_t >(); | ||
state.counters["fiber_num"] = SISL_OPTIONS["num_fibers"].as< uint32_t >(); | ||
state.counters["total_ops"] = totol_ops; | ||
state.counters["rate"] = benchmark::Counter(totol_ops, benchmark::Counter::kIsRate); | ||
state.counters["InvRate"] = | ||
benchmark::Counter(totol_ops, benchmark::Counter::kIsRate | benchmark::Counter::kInvert); | ||
} | ||
|
||
CREATE_BENCHMARK_CASE(put) | ||
CREATE_BENCHMARK_CASE(remove) | ||
CREATE_BENCHMARK_CASE(range_put) | ||
CREATE_BENCHMARK_CASE(query) | ||
|
||
INDEX_BETREE_BENCHMARK(FixedLenBtree) | ||
INDEX_BETREE_BENCHMARK(VarKeySizeBtree) | ||
INDEX_BETREE_BENCHMARK(VarValueSizeBtree) | ||
INDEX_BETREE_BENCHMARK(VarObjSizeBtree) | ||
INDEX_BETREE_BENCHMARK(PrefixIntervalBtree) | ||
|
||
int main(int argc, char** argv) { | ||
SISL_OPTIONS_LOAD(argc, argv, logging, index_btree_benchmark, iomgr, test_common_setup); | ||
// sisl::logging::SetLogger("index_btree_benchmark"); | ||
::benchmark::Initialize(&argc, argv); | ||
::benchmark::RunSpecifiedBenchmarks(); | ||
} |
Oops, something went wrong.