/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
H A D | Clustering.h | 94 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 138 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/llvm11/llvm-11.0.1.src/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
H A D | Clustering.h | 94 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 138 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/llvm10/llvm-10.0.1.src/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 42 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 46 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 63 assert(P < Points_.size()); in areAllNeighbours() 78 assert(P < Points_.size()); in areAllNeighbours() 90 : Points_(Points), in InstructionBenchmarkClustering() 95 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 100 const auto &Point = Points_[P]; in validateAndSetup() 191 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 202 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 255 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
H A D | Clustering.h | 94 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 138 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
H A D | Clustering.h | 94 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 138 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
H A D | Clustering.h | 94 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 138 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 42 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 46 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 63 assert(P < Points_.size()); in areAllNeighbours() 78 assert(P < Points_.size()); in areAllNeighbours() 90 : Points_(Points), in InstructionBenchmarkClustering() 95 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 100 const auto &Point = Points_[P]; in validateAndSetup() 191 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 202 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 255 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 44 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 48 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 assert(P < Points_.size()); in areAllNeighbours() 80 assert(P < Points_.size()); in areAllNeighbours() 92 : Points_(Points), in InstructionBenchmarkClustering() 97 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 102 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() 256 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 46 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 50 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 67 assert(P < Points_.size()); in areAllNeighbours() 82 assert(P < Points_.size()); in areAllNeighbours() 94 : Points_(Points), in InstructionBenchmarkClustering() 99 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 104 const auto &Point = Points_[P]; in validateAndSetup() 198 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 212 assert(NumClusters <= Points_.size() && in clusterizeNaive() 270 for (auto Point : zip(Points_, ClusterIdForPoint_)) { in stabilize() [all …]
|
H A D | Clustering.h | 95 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 140 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/llvm90/llvm-9.0.1.src/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 42 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 46 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 63 assert(P < Points_.size()); in areAllNeighbours() 78 assert(P < Points_.size()); in areAllNeighbours() 79 const auto &PMeasurements = Points_[P].Measurements; in areAllNeighbours() 90 : Points_(Points), in InstructionBenchmarkClustering() 95 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 100 const auto &Point = Points_[P]; in validateAndSetup() 192 const InstructionBenchmark &Point = Points_[P]; in clusterizeNaive() 203 assert(NumOpcodesSeen <= Points_.size() && in clusterizeNaive() [all …]
|
H A D | Clustering.h | 94 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 138 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/llvm80/llvm-8.0.1.src/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 39 Neighbors.reserve(Points_.size() - 1); // The Q itself isn't a neighbor. in rangeQuery() 40 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 41 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in rangeQuery() 44 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 56 : Points_(Points), EpsilonSquared_(EpsilonSquared), in InstructionBenchmarkClustering() 60 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 64 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in validateAndSetup() 65 const auto &Point = Points_[P]; in validateAndSetup() 96 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in dbScan() 144 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in dbScan()
|
H A D | Clustering.h | 76 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 109 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/devel/llvm70/llvm-7.0.1.src/tools/llvm-exegesis/lib/ |
H A D | Clustering.cpp | 37 const auto &QMeasurements = Points_[Q].Measurements; in rangeQuery() 38 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in rangeQuery() 41 const auto &PMeasurements = Points_[P].Measurements; in rangeQuery() 65 : Points_(Points), EpsilonSquared_(EpsilonSquared), in InstructionBenchmarkClustering() 69 ClusterIdForPoint_.resize(Points_.size()); in validateAndSetup() 73 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in validateAndSetup() 74 const auto &Point = Points_[P]; in validateAndSetup() 104 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in dbScan() 149 for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) { in dbScan()
|
H A D | Clustering.h | 75 const std::vector<InstructionBenchmark> &getPoints() const { return Points_; } in getPoints() 101 const std::vector<InstructionBenchmark> &Points_; variable
|
/dports/audio/wavbreaker/wavbreaker-0.13/src/ |
H A D | sample.h | 24 typedef struct Points_ Points; 25 struct Points_ { struct
|