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

  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
UopsBenchmarkRunner.cpp 18 Expected<std::vector<BenchmarkMeasure>>
20 std::vector<BenchmarkMeasure> Result;
31 Result.push_back(BenchmarkMeasure::Create(IssueCounter->ProcResName,
40 BenchmarkMeasure::Create("NumMicroOps", *ExpectedCounterValue));
UopsBenchmarkRunner.h 31 Expected<std::vector<BenchmarkMeasure>>
LatencyBenchmarkRunner.cpp 66 Expected<std::vector<BenchmarkMeasure>> LatencyBenchmarkRunner::runMeasurements(
111 std::vector<BenchmarkMeasure> Result;
114 Result.push_back(BenchmarkMeasure::Create(ModeName, Value));
118 std::vector<BenchmarkMeasure> Result;
120 BenchmarkMeasure::Create(ModeName, findMin(AccumulatedValues)));
124 std::vector<BenchmarkMeasure> Result;
126 BenchmarkMeasure::Create(ModeName, findMax(AccumulatedValues)));
130 std::vector<BenchmarkMeasure> Result;
132 BenchmarkMeasure::Create(ModeName, findMean(AccumulatedValues)));
BenchmarkResult.h 45 struct BenchmarkMeasure {
46 // A helper to create an unscaled BenchmarkMeasure.
47 static BenchmarkMeasure Create(std::string Key, double Value) {
73 std::vector<BenchmarkMeasure> Measurements;
100 void push(const BenchmarkMeasure &BM);
LatencyBenchmarkRunner.h 30 Expected<std::vector<BenchmarkMeasure>>
Clustering.h 110 bool isNeighbour(const std::vector<BenchmarkMeasure> &P,
111 const std::vector<BenchmarkMeasure> &Q,
155 std::vector<BenchmarkMeasure> getAsPoint() const;
157 void addPoint(ArrayRef<BenchmarkMeasure> Point);
SchedClassResolution.h 47 std::vector<BenchmarkMeasure>
SchedClassResolution.cpp 260 std::vector<BenchmarkMeasure> ResolvedSchedClass::getAsPoint(
265 std::vector<BenchmarkMeasure> SchedClassPoint(NumMeasurements);
269 BenchmarkMeasure &LatencyMeasure = SchedClassPoint[0];
282 BenchmarkMeasure &Measure = std::get<0>(I);
309 BenchmarkMeasure &RThroughputMeasure = SchedClassPoint[0];
BenchmarkRunner.h 81 virtual Expected<std::vector<BenchmarkMeasure>>
Clustering.cpp 66 ArrayRef<BenchmarkMeasure> Measurements = Points_[P].Measurements;
71 const std::vector<BenchmarkMeasure> Centroid = G.getAsPoint();
100 const std::vector<BenchmarkMeasure> *LastMeasurement = nullptr;
345 void SchedClassClusterCentroid::addPoint(ArrayRef<BenchmarkMeasure> Point) {
355 std::vector<BenchmarkMeasure> SchedClassClusterCentroid::getAsPoint() const {
356 std::vector<BenchmarkMeasure> ClusterCenterPoint(Representative.size());
BenchmarkRunner.cpp 224 for (BenchmarkMeasure &BM : *NewMeasurements) {
242 BenchmarkMeasure &Measurement = std::get<0>(I);
243 BenchmarkMeasure &NewMeasurement = std::get<1>(I);
BenchmarkResult.cpp 214 template <> struct SequenceElementTraits<exegesis::BenchmarkMeasure> {
220 template <> struct MappingTraits<exegesis::BenchmarkMeasure> {
221 static void mapping(IO &Io, exegesis::BenchmarkMeasure &Obj) {
416 void PerInstructionStats::push(const BenchmarkMeasure &BM) {
Analysis.cpp 360 const std::vector<BenchmarkMeasure> ClusterCenterPoint =
363 const std::vector<BenchmarkMeasure> SchedClassPoint =

Completed in 18 milliseconds