Searched refs:Clustering (Results 1 – 11 of 11) sorted by relevance
| /external/llvm-project/llvm/unittests/tools/llvm-exegesis/ |
| D | ClusteringTest.cpp | 49 auto Clustering = InstructionBenchmarkClustering::create( in TEST() local
51 ASSERT_TRUE((bool)Clustering); in TEST()
52 EXPECT_THAT(Clustering.get().getValidClusters(), in TEST()
54 EXPECT_THAT(Clustering.get().getCluster( in TEST()
57 EXPECT_THAT(Clustering.get().getCluster( in TEST()
61 EXPECT_EQ(Clustering.get().getClusterIdForPoint(2), in TEST()
63 EXPECT_EQ(Clustering.get().getClusterIdForPoint(5), in TEST()
65 EXPECT_EQ(Clustering.get().getClusterIdForPoint(0), in TEST()
66 Clustering.get().getClusterIdForPoint(3)); in TEST()
67 EXPECT_EQ(Clustering.get().getClusterIdForPoint(1), in TEST()
[all …]
|
| /external/llvm-project/llvm/tools/llvm-exegesis/lib/ |
| D | Analysis.cpp | 155 const InstructionBenchmarkClustering &Clustering, in Analysis() argument
158 : Clustering_(Clustering), InstrInfo_(std::move(InstrInfo)), in Analysis()
162 if (Clustering.getPoints().empty()) in Analysis()
165 const InstructionBenchmark &FirstPoint = Clustering.getPoints().front(); in Analysis()
337 size_t PointId, const InstructionBenchmarkClustering &Clustering) { in addPoint() argument
339 const auto &Point = Clustering.getPoints()[PointId]; in addPoint()
341 ClusterId = Clustering.getClusterIdForPoint(PointId); in addPoint()
342 assert(ClusterId == Clustering.getClusterIdForPoint(PointId)); in addPoint()
349 const InstructionBenchmarkClustering &Clustering, in measurementsMatch() argument
351 assert(!Clustering.getPoints().empty()); in measurementsMatch()
[all …]
|
| D | Clustering.cpp | 321 InstructionBenchmarkClustering Clustering( in create() local
323 if (auto Error = Clustering.validateAndSetup()) { in create()
326 if (Clustering.ErrorCluster_.PointIndices.size() == Points.size()) { in create()
327 return Clustering; // Nothing to cluster. in create()
331 Clustering.clusterizeDbScan(DbscanMinPts); in create()
334 Clustering.stabilize(NumOpcodes.getValue()); in create()
339 Clustering.clusterizeNaive(NumOpcodes.getValue()); in create()
342 return Clustering; in create()
|
| D | Analysis.h | 40 const InstructionBenchmarkClustering &Clustering,
64 const InstructionBenchmarkClustering &Clustering);
72 const InstructionBenchmarkClustering &Clustering,
|
| D | CMakeLists.txt | 28 Clustering.cpp
|
| /external/llvm-project/llvm/utils/gn/secondary/llvm/tools/llvm-exegesis/lib/ |
| D | BUILD.gn | 22 "Clustering.cpp",
|
| /external/llvm-project/llvm/tools/llvm-exegesis/ |
| D | llvm-exegesis.cpp | 432 const auto Clustering = ExitOnErr(InstructionBenchmarkClustering::create( in analysisMain() local
436 const Analysis Analyzer(*TheTarget, std::move(InstrInfo), Clustering, in analysisMain()
|
| /external/tensorflow/tensorflow/lite/g3doc/performance/ |
| D | model_optimization.md | 179 ### Clustering subsection
181 [Clustering](https://www.tensorflow.org/model_optimization/guide/clustering)
|
| /external/one-true-awk/testdir/ |
| D | funstack.ok | 134 Code Eliminating Secondary Clustering 107--109
1800 Tree Clustering Method . . . . . . . . . 321--323
3579 Spanning Tree Clustering Method [Z]'' 110--111
|
| D | funstack.in | 800 title = "The Quadratic Quotient Method: {A} Hash Code Eliminating Secondary Clustering",
13489 title = "{ACM} Algorithm 479: {A} Minimal Spanning Tree Clustering Method",
19831 …abstract = "Clustering in the key set is decreased by smoothing the key-to-address transformat…
26676 title = "Remark on {``Algorithm 479: A Minimal Spanning Tree Clustering Method [Z]''}",
27157 …cases, estimates are available to reach any desired level of accuracy. Clustering models in Euclid…
|
| /external/brotli/tests/testdata/ |
| D | plrabn12.txt | 2989 Clustering, but not beneath his shoulders broad:
|