File: DecisionForestBenchmark.cpp

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-16
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 1,496,368 kB
  • sloc: cpp: 5,593,980; ansic: 986,873; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,547; xml: 953; cs: 573; fortran: 567
file content (84 lines) | stat: -rw-r--r-- 3,069 bytes parent folder | download | duplicates (7)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
//===--- DecisionForestBenchmark.cpp ------------*- C++ -*-===//
//
// Benchmark for code completion ranking latency.
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
// Usage:
//    ninja DecisionForestBenchmark && \
//    tools/clang/tools/extra/clangd/benchmarks/CompletionModel/DecisionForestBenchmark
//===----------------------------------------------------------------------===//

#include "CompletionModel.h"
#include "benchmark/benchmark.h"
#include "llvm/ADT/StringRef.h"

#include <random>

namespace clang {
namespace clangd {
namespace {
std::vector<Example> generateRandomDataset(int NumExamples) {
  auto FlipCoin = [&](double Probability) {
    return rand() % 1000 <= Probability * 1000;
  };
  auto RandInt = [&](int Max) { return rand() % Max; };
  auto RandFloat = [&](float Max = 1.0) {
    return rand() % 1000 / 1000.0 * Max;
  };

  std::vector<Example> Examples;
  Examples.reserve(NumExamples);
  for (int I = 0; I < NumExamples; ++I) {
    Example E;
    E.setIsDeprecated(FlipCoin(0.1));           // Boolean.
    E.setIsReservedName(FlipCoin(0.1));         // Boolean.
    E.setIsImplementationDetail(FlipCoin(0.3)); // Boolean.
    E.setNumReferences(RandInt(10000));         // Can be large integer.
    E.setSymbolCategory(RandInt(10));           // 10 Symbol Category.
    E.setNumNameInContext(RandInt(20));         // 0 to ContextWords->size().
    E.setFractionNameInContext(RandFloat(1.0)); // Float in range [0,1].
    E.setIsNameInContext(FlipCoin(0.5)); // Boolean.
    E.setIsInBaseClass(FlipCoin(0.3));   // Boolean.
    E.setFileProximityDistanceCost(
        FlipCoin(0.1) ? 999999 // Sometimes file distance is not available.
                      : RandInt(20));
    E.setSemaFileProximityScore(RandFloat(1)); // Float in range [0,1].
    E.setSymbolScopeDistanceCost(
        FlipCoin(0.1) ? 999999 // Sometimes scope distance is not available.
                      : RandInt(20));
    E.setSemaSaysInScope(FlipCoin(0.5));      // Boolean.
    E.setScope(RandInt(4));                   // 4 Scopes.
    E.setContextKind(RandInt(36));            // 36 Context kinds.
    E.setIsInstanceMember(FlipCoin(0.5));     // Boolean.
    E.setHadContextType(FlipCoin(0.6));       // Boolean.
    E.setHadSymbolType(FlipCoin(0.6));        // Boolean.
    E.setTypeMatchesPreferred(FlipCoin(0.5)); // Boolean.
    Examples.push_back(E);
  }
  return Examples;
}

void runDecisionForestPrediciton(const std::vector<Example> Examples) {
  for (const Example &E : Examples)
    Evaluate(E);
}

static void decisionForestPredict(benchmark::State &State) {
  srand(0);
  for (auto _ : State) {
    State.PauseTiming();
    const std::vector<Example> Examples = generateRandomDataset(1000000);
    State.ResumeTiming();
    runDecisionForestPrediciton(Examples);
  }
}
BENCHMARK(decisionForestPredict);

} // namespace
} // namespace clangd
} // namespace clang

BENCHMARK_MAIN();