Home
last modified time | relevance | path

Searched refs:Points (Results 1 – 25 of 36) sorted by relevance

12

/llvm-project-15.0.7/llvm/unittests/tools/llvm-exegesis/
H A DClusteringTest.cpp34 Points[0].Measurements = { in TEST()
36 Points[3].Measurements = { in TEST()
39 Points[1].Measurements = { in TEST()
41 Points[4].Measurements = { in TEST()
44 Points[5].Measurements = { in TEST()
47 Points[2].Error = "oops"; in TEST()
73 Points[0].Measurements = { in TEST()
113 Points[0].Measurements = { in TEST()
115 Points[1].Measurements = { in TEST()
117 Points[2].Measurements = { in TEST()
[all …]
/llvm-project-15.0.7/clang/test/OpenMP/
H A Dreduction_compound_op.cpp46 void work(Point &P, int N, Point const *Points);
48 void foo(int N, Point const *Points) { in foo() argument
52 work(Red, I, Points); in foo()
56 work(Red, I, Points); in foo()
60 work(Red, I, Points); in foo()
64 work(Red, I, Points); in foo()
68 work(Red, I, Points); in foo()
72 work(Red, I, Points); in foo()
76 work(Red, I, Points); in foo()
80 work(Red, I, Points); in foo()
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DPrintASTTests.cpp36 Visitor(std::vector<Position> Points) : Points(std::move(Points)) {} in TEST_P()
38 if (TemplateArgsAtPoints.size() == Points.size()) in TEST_P()
42 if (Pos != Points[TemplateArgsAtPoints.size()]) in TEST_P()
48 const std::vector<Position> Points; in TEST_P() member
H A DIncludeCleanerTests.cpp254 std::vector<Position> Points; in TEST() local
258 Points.push_back(offsetToPosition( in TEST()
262 llvm::sort(Points); in TEST()
264 EXPECT_EQ(Points, Header.points()) << T.HeaderCode << "\n---\n" in TEST()
/llvm-project-15.0.7/llvm/lib/Testing/Support/
H A DAnnotations.cpp36 Points[Name.value_or("")].push_back(Code.size()); in Annotations()
69 auto I = Points.find(Name); in point()
70 require(I != Points.end() && I->getValue().size() == 1, in point()
76 auto I = Points.find(Name); in points()
77 if (I == Points.end()) in points()
/llvm-project-15.0.7/llvm/tools/sancov/
H A Dsancov.cpp179 std::vector<CoveragePoint> Points; member
320 for (const auto &Point : Points) { in operator <<()
384 std::map<std::string, CoveragePoint> Points; in read() local
403 yaml::SequenceNode *Points = in read() local
407 for (auto I = Points->begin(), E = Points->end(); I != E; ++I) { in read()
441 if (Points.find(PointId) == Points.end()) in read()
461 for (auto &KV : Points) { in read()
462 Coverage->Points.push_back(KV.second); in read()
943 for (const auto &Point : Points) { in computeFunctions()
955 for (const auto &Point : Coverage.Points) { in computeNotCoveredFunctions()
[all …]
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/
H A DClustering.cpp92 const std::vector<InstructionBenchmark> &Points, in InstructionBenchmarkClustering() argument
94 : Points_(Points), in InstructionBenchmarkClustering()
205 auto &Points = OpcodeToSchedClassesToPoints[Opcode][SchedClassId]; in clusterizeNaive() local
206 if (Points.empty()) // If we previously have not seen any points of in clusterizeNaive()
208 Points.emplace_back(P); in clusterizeNaive()
332 const std::vector<InstructionBenchmark> &Points, const ModeE Mode, in create() argument
336 Points, AnalysisClusteringEpsilon * AnalysisClusteringEpsilon); in create()
340 if (Clustering.ErrorCluster_.PointIndices.size() == Points.size()) { in create()
H A DAnalysis.cpp223 const auto &Points = Clustering_.getPoints(); in makePointsPerSchedClass() local
224 for (size_t PointId = 0, E = Points.size(); PointId < E; ++PointId) { in makePointsPerSchedClass()
225 const InstructionBenchmark &Point = Points[PointId]; in makePointsPerSchedClass()
304 const auto &Points = Clustering_.getPoints(); in printSchedClassClustersHtml() local
309 Points[Clusters[0].getPointIds()[0]].Measurements) { in printSchedClassClustersHtml()
325 printPointHtml(Points[PointId], OS); in printSchedClassClustersHtml()
440 const auto &Points = Clustering_.getPoints(); in printClusterRawHtml() local
450 for (const auto &Measurement : Points[Cluster.PointIndices[0]].Measurements) { in printClusterRawHtml()
460 printPointHtml(Points[PointId], OS); in printClusterRawHtml()
462 for (const auto &Measurement : Points[PointId].Measurements) { in printClusterRawHtml()
H A DClustering.h33 create(const std::vector<InstructionBenchmark> &Points, ModeE Mode,
124 const std::vector<InstructionBenchmark> &Points,
/llvm-project-15.0.7/clang/lib/Tooling/
H A DInterpolatingCompilationDatabase.cpp395 auto Award = [&](int Points, ArrayRef<SubstringAndIndex> Range) { in scoreCandidates() argument
397 Candidates[Entry.second] += Points; in scoreCandidates()
421 int Points; in pickWinner() member
431 S.Points = Candidate.second; in pickWinner()
435 if (S.Points < Best.Points) in pickWinner()
437 if (S.Points == Best.Points) { in pickWinner()
456 return {Best.Index, Best.Points}; in pickWinner()
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/
H A Dllvm-exegesis.cpp419 const std::vector<InstructionBenchmark> Points = ExitOnFileError( in analysisMain() local
422 outs() << "Parsed " << Points.size() << " benchmark points\n"; in analysisMain()
423 if (Points.empty()) { in analysisMain()
432 TargetRegistry::lookupTarget(Points[0].LLVMTriple, Error); in analysisMain()
434 errs() << "unknown target '" << Points[0].LLVMTriple << "'\n"; in analysisMain()
439 TheTarget->createMCSubtargetInfo(Points[0].LLVMTriple, CpuName, "")); in analysisMain()
445 Points, AnalysisClusteringAlgorithm, AnalysisDbscanNumPoints, in analysisMain()
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Drectangular-tiling.ll10 ; CHECK: // 1st level tiling - Points
23 ; TWOLEVEL: // 1st level tiling - Points
27 ; TWOLEVEL: // 2nd level tiling - Points
36 ; TWO-PLUS-REGISTER: // 1st level tiling - Points
40 ; TWO-PLUS-REGISTER: // 2nd level tiling - Points
44 ; TWO-PLUS-REGISTER: // Register tiling - Points
H A Dpattern-matching-based-opts_3.ll32 ; CHECK-NEXT: // 1st level tiling - Points
41 ; CHECK-NEXT: // Register tiling - Points
84 ; EXTRACTION-OF-MACRO-KERNEL-NEXT: // 1st level tiling - Points
98 ; EXTRACTION-OF-MACRO-KERNEL-NEXT: // 1st level tiling - Points
104 ; EXTRACTION-OF-MACRO-KERNEL-NEXT: // Register tiling - Points
H A Dmat_mul_pattern_data_layout_2.ll26 ; CHECK-NEXT: // 1st level tiling - Points
40 ; CHECK-NEXT: // 1st level tiling - Points
46 ; CHECK-NEXT: // Register tiling - Points
H A Dpattern-matching-based-opts_13.ll23 ; CHECK-NEXT: // 1st level tiling - Points
30 ; CHECK-NEXT: // Register tiling - Points
68 ; CHECK-NEXT: // Register tiling - Points
H A Dpattern-matching-based-opts_5.ll50 ; CHECK-NEXT: // 1st level tiling - Points
58 ; CHECK-NEXT: // Register tiling - Points
98 ; CHECK-NEXT: // Register tiling - Points
133 ; CHECK-NEXT: // Register tiling - Points
173 ; CHECK-NEXT: // Register tiling - Points
259 ; CHECK-NEXT: // Register tiling - Points
334 ; CHECK-NEXT: // Register tiling - Points
H A Dpattern-matching-based-opts_6.ll50 ; CHECK-NEXT: // 1st level tiling - Points
57 ; CHECK-NEXT: // Register tiling - Points
96 ; CHECK-NEXT: // Register tiling - Points
H A Dpattern-matching-based-opts_8.ll35 ; CHECK-NEXT: // 1st level tiling - Points
41 ; CHECK-NEXT: // Register tiling - Points
H A Dpattern-matching-based-opts_4.ll34 ; PATTERN-MATCHING-OPTS-NEXT: // 1st level tiling - Points
40 ; PATTERN-MATCHING-OPTS-NEXT: // Register tiling - Points
H A Dpattern-matching-based-opts_7.ll34 ; CHECK-NEXT: // 1st level tiling - Points
40 ; CHECK-NEXT: // Register tiling - Points
H A Densure-correct-tile-sizes.ll29 ; CHECK-NEXT: // 1st level tiling - Points
38 ; CHECK-NEXT: // Register tiling - Points
/llvm-project-15.0.7/llvm/test/tools/llvm-gsymutil/X86/
H A Dmacho-invalid-section-offset.yaml30 n_sect: 3 # Points to an invalid offset.
/llvm-project-15.0.7/llvm/include/llvm/Testing/Support/
H A DAnnotations.h85 llvm::StringMap<llvm::SmallVector<size_t, 1>> Points; variable
/llvm-project-15.0.7/llvm/unittests/Support/
H A DAnnotationsTest.cpp28 TEST(AnnotationsTest, Points) { in TEST() argument
/llvm-project-15.0.7/libc/AOR_v20.02/string/arm/
H A Dmemchr.S115 subeq r0,r0,#3 @ Points to 2nd byte of 2nd word

12