Home
last modified time | relevance | path

Searched refs:Clustering (Results 1 – 9 of 9) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
H A DAnalysis.cpp155 const InstructionBenchmarkClustering &Clustering, in Analysis() argument
159 : Clustering_(Clustering), InstrInfo_(std::move(InstrInfo)), in Analysis()
163 if (Clustering.getPoints().empty()) in Analysis()
166 const InstructionBenchmark &FirstPoint = Clustering.getPoints().front(); in Analysis()
340 size_t PointId, const InstructionBenchmarkClustering &Clustering) { in addPoint() argument
342 const auto &Point = Clustering.getPoints()[PointId]; in addPoint()
344 ClusterId = Clustering.getClusterIdForPoint(PointId); in addPoint()
345 assert(ClusterId == Clustering.getClusterIdForPoint(PointId)); in addPoint()
352 const InstructionBenchmarkClustering &Clustering, in measurementsMatch() argument
354 assert(!Clustering.getPoints().empty()); in measurementsMatch()
[all …]
H A DClustering.cpp321 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()
H A DAnalysis.h40 const InstructionBenchmarkClustering &Clustering,
65 const InstructionBenchmarkClustering &Clustering);
73 const InstructionBenchmarkClustering &Clustering,
H A DCMakeLists.txt50 Clustering.cpp
/netbsd-src/external/apache2/llvm/dist/llvm/utils/gn/secondary/llvm/tools/llvm-exegesis/lib/
H A DBUILD.gn22 "Clustering.cpp",
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/
H A Dllvm-exegesis.cpp434 const auto Clustering = ExitOnErr(InstructionBenchmarkClustering::create( in analysisMain() local
438 const Analysis Analyzer(*TheTarget, std::move(InstrInfo), Clustering, in analysisMain()
/netbsd-src/external/historical/nawk/dist/testdir/
H A Dfunstack.ok134 Code Eliminating Secondary Clustering 107--109
1800 Tree Clustering Method . . . . . . . . . 321--323
3579 Spanning Tree Clustering Method [Z]'' 110--111
H A Dfunstack.in800 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…
/netbsd-src/etc/
H A Dservices14104 cp-cluster 8116/tcp # Check Point Clustering [Roni_Moshitzky] …
14105 cp-cluster 8116/udp # Check Point Clustering [Roni_Moshitzky] …