//===-- Target.cpp ----------------------------------------------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// #include "Target.h" #include "LatencyBenchmarkRunner.h" #include "ParallelSnippetGenerator.h" #include "SerialSnippetGenerator.h" #include "UopsBenchmarkRunner.h" #include "llvm/ADT/Twine.h" #include "llvm/Support/Error.h" namespace llvm { namespace exegesis { ExegesisTarget::~ExegesisTarget() {} // anchor. static ExegesisTarget *FirstTarget = nullptr; const ExegesisTarget *ExegesisTarget::lookup(Triple TT) { for (const ExegesisTarget *T = FirstTarget; T != nullptr; T = T->Next) { if (T->matchesArch(TT.getArch())) return T; } return nullptr; } Expected> ExegesisTarget::createCounter(StringRef CounterName, const LLVMState &) const { pfm::PerfEvent Event(CounterName); if (!Event.valid()) return llvm::make_error( llvm::Twine("Unable to create counter with name '") .concat(CounterName) .concat("'")); return std::make_unique(std::move(Event)); } void ExegesisTarget::registerTarget(ExegesisTarget *Target) { if (FirstTarget == nullptr) { FirstTarget = Target; return; } if (Target->Next != nullptr) return; // Already registered. Target->Next = FirstTarget; FirstTarget = Target; } std::unique_ptr ExegesisTarget::createSnippetGenerator( InstructionBenchmark::ModeE Mode, const LLVMState &State, const SnippetGenerator::Options &Opts) const { switch (Mode) { case InstructionBenchmark::Unknown: return nullptr; case InstructionBenchmark::Latency: return createSerialSnippetGenerator(State, Opts); case InstructionBenchmark::Uops: case InstructionBenchmark::InverseThroughput: return createParallelSnippetGenerator(State, Opts); } return nullptr; } Expected> ExegesisTarget::createBenchmarkRunner( InstructionBenchmark::ModeE Mode, const LLVMState &State, InstructionBenchmark::ResultAggregationModeE ResultAggMode) const { PfmCountersInfo PfmCounters = State.getPfmCounters(); switch (Mode) { case InstructionBenchmark::Unknown: return nullptr; case InstructionBenchmark::Latency: case InstructionBenchmark::InverseThroughput: if (!PfmCounters.CycleCounter) { const char *ModeName = Mode == InstructionBenchmark::Latency ? "latency" : "inverse_throughput"; return make_error( Twine("can't run '") .concat(ModeName) .concat("' mode, sched model does not define a cycle counter.")); } return createLatencyBenchmarkRunner(State, Mode, ResultAggMode); case InstructionBenchmark::Uops: if (!PfmCounters.UopsCounter && !PfmCounters.IssueCounters) return make_error("can't run 'uops' mode, sched model does not " "define uops or issue counters."); return createUopsBenchmarkRunner(State, ResultAggMode); } return nullptr; } std::unique_ptr ExegesisTarget::createSerialSnippetGenerator( const LLVMState &State, const SnippetGenerator::Options &Opts) const { return std::make_unique(State, Opts); } std::unique_ptr ExegesisTarget::createParallelSnippetGenerator( const LLVMState &State, const SnippetGenerator::Options &Opts) const { return std::make_unique(State, Opts); } std::unique_ptr ExegesisTarget::createLatencyBenchmarkRunner( const LLVMState &State, InstructionBenchmark::ModeE Mode, InstructionBenchmark::ResultAggregationModeE ResultAggMode) const { return std::make_unique(State, Mode, ResultAggMode); } std::unique_ptr ExegesisTarget::createUopsBenchmarkRunner( const LLVMState &State, InstructionBenchmark::ResultAggregationModeE /*unused*/) const { return std::make_unique(State); } static_assert(std::is_pod::value, "We shouldn't have dynamic initialization here"); const PfmCountersInfo PfmCountersInfo::Default = {nullptr, nullptr, nullptr, 0u}; const PfmCountersInfo &ExegesisTarget::getPfmCounters(StringRef CpuName) const { assert(llvm::is_sorted( CpuPfmCounters, [](const CpuAndPfmCounters &LHS, const CpuAndPfmCounters &RHS) { return strcmp(LHS.CpuName, RHS.CpuName) < 0; }) && "CpuPfmCounters table is not sorted"); // Find entry auto Found = std::lower_bound(CpuPfmCounters.begin(), CpuPfmCounters.end(), CpuName); if (Found == CpuPfmCounters.end() || StringRef(Found->CpuName) != CpuName) { // Use the default. if (CpuPfmCounters.begin() != CpuPfmCounters.end() && CpuPfmCounters.begin()->CpuName[0] == '\0') { Found = CpuPfmCounters.begin(); // The target specifies a default. } else { return PfmCountersInfo::Default; // No default for the target. } } assert(Found->PCI && "Missing counters"); return *Found->PCI; } ExegesisTarget::SavedState::~SavedState() {} // anchor. namespace { // Default implementation. class ExegesisDefaultTarget : public ExegesisTarget { public: ExegesisDefaultTarget() : ExegesisTarget({}) {} private: std::vector setRegTo(const MCSubtargetInfo &STI, unsigned Reg, const APInt &Value) const override { llvm_unreachable("Not yet implemented"); } bool matchesArch(Triple::ArchType Arch) const override { llvm_unreachable("never called"); return false; } }; } // namespace const ExegesisTarget &ExegesisTarget::getDefault() { static ExegesisDefaultTarget Target; return Target; } } // namespace exegesis } // namespace llvm