Function BM_StringConcat

eval/tests/expression_builder_benchmark_test.cc:378–409

    ->Arg(BenchmarkParam::kRecursivePlanningWithConstantFolding);

void BM_StringConcat(benchmark::State& state) {
  auto param = static_cast<BenchmarkParam>(state.range(0));
  state.SetLabel(LabelForParam(param));
  auto size = state.range(1);

  std::string source = "'1234567890' + '1234567890'";
  auto height = static_cast<int>(std::log2(size));
  for (int i = 1; i < height; i++) {
    // Force the parse to be a binary tree, otherwise we can hit
    // recursion limits.
    source = absl::StrCat("(", source, " + ", source, ")");
  }

  // add a non const branch to the expression.
  absl::StrAppend(&source, " + identifier");

  ASSERT_OK_AND_ASSIGN(ParsedExpr expr, parser::Parse(source));

  google::protobuf::Arena arena;
  InterpreterOptions options = OptionsForParam(param, arena);

  auto builder = CreateCelExpressionBuilder(options);
  auto reg_status = RegisterBuiltinFunctions(builder->GetRegistry());
  ASSERT_OK(reg_status);

  for (auto _ : state) {
    ASSERT_OK_AND_ASSIGN(
        auto expression,
        builder->CreateExpression(&expr.expr(), &expr.source_info()));
    arena.Reset();
  }
}

BENCHMARK(BM_StringConcat)
    ->Args({BenchmarkParam::kDefault, 2})