Home
last modified time | relevance | path

Searched defs:Points (Results 1 – 7 of 7) sorted by relevance

/openbsd-src/gnu/llvm/llvm/tools/llvm-exegesis/lib/
H A DClustering.cpp92 const std::vector<InstructionBenchmark> &Points, in InstructionBenchmarkClustering()
205 auto &Points = OpcodeToSchedClassesToPoints[Opcode][SchedClassId]; in clusterizeNaive() local
331 const std::vector<InstructionBenchmark> &Points, const ModeE Mode, in create()
H A DAnalysis.cpp216 const auto &Points = Clustering_.getPoints(); in makePointsPerSchedClass() local
297 const auto &Points = Clustering_.getPoints(); in printSchedClassClustersHtml() local
432 const auto &Points = Clustering_.getPoints(); in printClusterRawHtml() local
/openbsd-src/gnu/llvm/llvm/include/llvm/Testing/Annotations/
H A DAnnotations.h124 llvm::StringMap<llvm::SmallVector<size_t, 1>> Points; variable
/openbsd-src/gnu/llvm/llvm/tools/llvm-exegesis/
H A Dllvm-exegesis.cpp529 static void filterPoints(MutableArrayRef<InstructionBenchmark> Points, in filterPoints()
594 std::vector<InstructionBenchmark> Points = ExitOnFileError( in analysisMain() local
/openbsd-src/gnu/llvm/llvm/tools/sancov/
H A Dsancov.cpp170 std::vector<CoveragePoint> Points; member
308 const std::vector<CoveragePoint> &Points) { in operator <<()
375 std::map<std::string, CoveragePoint> Points; in read() local
394 yaml::SequenceNode *Points = in read() local
927 computeFunctions(const std::vector<CoveragePoint> &Points) { in computeFunctions()
/openbsd-src/gnu/llvm/clang/lib/Tooling/
H A DInterpolatingCompilationDatabase.cpp394 auto Award = [&](int Points, ArrayRef<SubstringAndIndex> Range) { in scoreCandidates()
420 int Points; in pickWinner() member
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DIntervalTree.h651 SmallVector<PointType, 4> Points; in create() local