3fd14e2d5f
Summary: Micro benchmarks show improvements in performance of MapLiteral from 5% to 40% depending on the size of the input. On the other hand, a sequence of AdditionOperators behaves the same with both allocation schemes. Reviewers: mtomic, mferencevic, msantl Reviewed By: mtomic Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D2132
86 lines
2.8 KiB
C++
86 lines
2.8 KiB
C++
#include <benchmark/benchmark.h>
|
|
|
|
#include "query/interpret/eval.hpp"
|
|
|
|
// The following classes are wrappers for utils::MemoryResource, so that we can
|
|
// use BENCHMARK_TEMPLATE
|
|
|
|
class MonotonicBufferResource final {
|
|
utils::MonotonicBufferResource memory_{query::kExecutionMemoryBlockSize};
|
|
|
|
public:
|
|
utils::MemoryResource *get() { return &memory_; }
|
|
};
|
|
|
|
class NewDeleteResource final {
|
|
public:
|
|
utils::MemoryResource *get() { return utils::NewDeleteResource(); }
|
|
};
|
|
|
|
template <class TMemory>
|
|
// NOLINTNEXTLINE(google-runtime-references)
|
|
static void MapLiteral(benchmark::State &state) {
|
|
query::AstStorage ast;
|
|
query::SymbolTable symbol_table;
|
|
query::Frame frame(symbol_table.max_position());
|
|
TMemory memory;
|
|
database::GraphDb db;
|
|
auto dba = db.Access();
|
|
std::unordered_map<query::PropertyIx, query::Expression *> elements;
|
|
for (int64_t i = 0; i < state.range(0); ++i) {
|
|
elements.emplace(ast.GetPropertyIx("prop" + std::to_string(i)),
|
|
ast.Create<query::PrimitiveLiteral>(i));
|
|
}
|
|
auto *expr = ast.Create<query::MapLiteral>(elements);
|
|
query::EvaluationContext evaluation_context{memory.get()};
|
|
evaluation_context.properties =
|
|
query::NamesToProperties(ast.properties_, &dba);
|
|
query::ExpressionEvaluator evaluator(&frame, symbol_table, evaluation_context,
|
|
&dba, query::GraphView::NEW);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(expr->Accept(evaluator));
|
|
}
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
BENCHMARK_TEMPLATE(MapLiteral, NewDeleteResource)
|
|
->Range(512, 1U << 15U)
|
|
->Unit(benchmark::kMicrosecond);
|
|
|
|
BENCHMARK_TEMPLATE(MapLiteral, MonotonicBufferResource)
|
|
->Range(512, 1U << 15U)
|
|
->Unit(benchmark::kMicrosecond);
|
|
|
|
template <class TMemory>
|
|
// NOLINTNEXTLINE(google-runtime-references)
|
|
static void AdditionOperator(benchmark::State &state) {
|
|
query::AstStorage ast;
|
|
query::SymbolTable symbol_table;
|
|
query::Frame frame(symbol_table.max_position());
|
|
TMemory memory;
|
|
database::GraphDb db;
|
|
auto dba = db.Access();
|
|
query::Expression *expr = ast.Create<query::PrimitiveLiteral>(0);
|
|
for (int64_t i = 0; i < state.range(0); ++i) {
|
|
expr = ast.Create<query::AdditionOperator>(
|
|
expr, ast.Create<query::PrimitiveLiteral>(i));
|
|
}
|
|
query::EvaluationContext evaluation_context{memory.get()};
|
|
query::ExpressionEvaluator evaluator(&frame, symbol_table, evaluation_context,
|
|
&dba, query::GraphView::NEW);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(expr->Accept(evaluator));
|
|
}
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
BENCHMARK_TEMPLATE(AdditionOperator, NewDeleteResource)
|
|
->Range(1024, 1U << 15U)
|
|
->Unit(benchmark::kMicrosecond);
|
|
|
|
BENCHMARK_TEMPLATE(AdditionOperator, MonotonicBufferResource)
|
|
->Range(1024, 1U << 15U)
|
|
->Unit(benchmark::kMicrosecond);
|
|
|
|
BENCHMARK_MAIN();
|