HomeSort by: relevance | last modified time | path
    Searched refs:Clustering (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
Analysis.h 17 #include "Clustering.h"
40 const InstructionBenchmarkClustering &Clustering,
65 const InstructionBenchmarkClustering &Clustering);
73 const InstructionBenchmarkClustering &Clustering,
Analysis.cpp 155 const InstructionBenchmarkClustering &Clustering,
159 : Clustering_(Clustering), InstrInfo_(std::move(InstrInfo)),
163 if (Clustering.getPoints().empty())
166 const InstructionBenchmark &FirstPoint = Clustering.getPoints().front();
340 size_t PointId, const InstructionBenchmarkClustering &Clustering) {
342 const auto &Point = Clustering.getPoints()[PointId];
344 ClusterId = Clustering.getClusterIdForPoint(PointId);
345 assert(ClusterId == Clustering.getClusterIdForPoint(PointId));
352 const InstructionBenchmarkClustering &Clustering,
354 assert(!Clustering.getPoints().empty())
    [all...]
Clustering.cpp 1 //===-- Clustering.cpp ------------------------------------------*- C++ -*-===//
9 #include "Clustering.h"
22 // The clustering problem has the following characteristics:
234 // performance characteristics measurements. And when we then do clustering,
321 InstructionBenchmarkClustering Clustering(
323 if (auto Error = Clustering.validateAndSetup()) {
326 if (Clustering.ErrorCluster_.PointIndices.size() == Points.size()) {
327 return Clustering; // Nothing to cluster.
331 Clustering.clusterizeDbScan(DbscanMinPts);
334 Clustering.stabilize(NumOpcodes.getValue())
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/
llvm-exegesis.cpp 17 #include "lib/Clustering.h"
132 "analysis-clustering", cl::desc("the clustering algorithm to use"),
146 "analysis-clustering-epsilon",
147 cl::desc("epsilon for benchmark point clustering"),
434 const auto Clustering = ExitOnErr(InstructionBenchmarkClustering::create(
438 const Analysis Analyzer(*TheTarget, std::move(InstrInfo), Clustering,

Completed in 17 milliseconds