2005-10-21 21:00:04 +02:00
|
|
|
//===- SubtargetEmitter.cpp - Generate subtarget enumerations -------------===//
|
|
|
|
//
|
2019-01-19 09:50:56 +01:00
|
|
|
// 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
|
2005-10-21 21:00:04 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2006-03-03 03:04:07 +01:00
|
|
|
// This tablegen backend emits subtarget enumerations.
|
2005-10-21 21:00:04 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "CodeGenTarget.h"
|
2012-07-07 06:00:00 +02:00
|
|
|
#include "CodeGenSchedule.h"
|
2018-05-25 17:55:37 +02:00
|
|
|
#include "PredicateExpander.h"
|
2016-05-17 19:04:23 +02:00
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
2016-12-09 23:06:55 +01:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2012-12-04 11:37:14 +01:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2016-12-09 23:06:55 +01:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2012-06-11 17:37:55 +02:00
|
|
|
#include "llvm/MC/MCInstrItineraries.h"
|
2016-05-17 19:04:23 +02:00
|
|
|
#include "llvm/MC/MCSchedule.h"
|
2015-05-26 12:47:10 +02:00
|
|
|
#include "llvm/MC/SubtargetFeature.h"
|
2012-12-04 11:37:14 +01:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/Format.h"
|
2016-05-17 19:04:23 +02:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2012-09-18 00:18:45 +02:00
|
|
|
#include "llvm/TableGen/Error.h"
|
2012-06-11 17:37:55 +02:00
|
|
|
#include "llvm/TableGen/Record.h"
|
|
|
|
#include "llvm/TableGen/TableGenBackend.h"
|
2005-10-28 03:43:09 +02:00
|
|
|
#include <algorithm>
|
2016-05-17 19:04:23 +02:00
|
|
|
#include <cassert>
|
|
|
|
#include <cstdint>
|
2016-12-09 23:06:55 +01:00
|
|
|
#include <iterator>
|
2012-06-11 17:37:55 +02:00
|
|
|
#include <map>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
2015-10-07 01:24:35 +02:00
|
|
|
|
2005-10-21 21:00:04 +02:00
|
|
|
using namespace llvm;
|
|
|
|
|
2014-04-22 05:06:00 +02:00
|
|
|
#define DEBUG_TYPE "subtarget-emitter"
|
|
|
|
|
2012-06-11 17:37:55 +02:00
|
|
|
namespace {
|
2016-05-17 19:04:23 +02:00
|
|
|
|
2012-06-11 17:37:55 +02:00
|
|
|
class SubtargetEmitter {
|
2012-09-18 00:18:48 +02:00
|
|
|
// Each processor has a SchedClassDesc table with an entry for each SchedClass.
|
|
|
|
// The SchedClassDesc table indexes into a global write resource table, write
|
|
|
|
// latency table, and read advance table.
|
|
|
|
struct SchedClassTables {
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<MCSchedClassDesc>> ProcSchedClasses;
|
2012-09-18 00:18:48 +02:00
|
|
|
std::vector<MCWriteProcResEntry> WriteProcResources;
|
|
|
|
std::vector<MCWriteLatencyEntry> WriteLatencies;
|
2012-09-19 06:43:19 +02:00
|
|
|
std::vector<std::string> WriterNames;
|
2012-09-18 00:18:48 +02:00
|
|
|
std::vector<MCReadAdvanceEntry> ReadAdvanceEntries;
|
|
|
|
|
|
|
|
// Reserve an invalid entry at index 0
|
|
|
|
SchedClassTables() {
|
|
|
|
ProcSchedClasses.resize(1);
|
|
|
|
WriteProcResources.resize(1);
|
|
|
|
WriteLatencies.resize(1);
|
2012-09-19 06:43:19 +02:00
|
|
|
WriterNames.push_back("InvalidWrite");
|
2012-09-18 00:18:48 +02:00
|
|
|
ReadAdvanceEntries.resize(1);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct LessWriteProcResources {
|
|
|
|
bool operator()(const MCWriteProcResEntry &LHS,
|
|
|
|
const MCWriteProcResEntry &RHS) {
|
|
|
|
return LHS.ProcResourceIdx < RHS.ProcResourceIdx;
|
|
|
|
}
|
|
|
|
};
|
2012-06-11 17:37:55 +02:00
|
|
|
|
2017-09-14 22:44:20 +02:00
|
|
|
const CodeGenTarget &TGT;
|
2012-06-11 17:37:55 +02:00
|
|
|
RecordKeeper &Records;
|
2012-07-07 06:00:00 +02:00
|
|
|
CodeGenSchedModels &SchedModels;
|
2012-06-11 17:37:55 +02:00
|
|
|
std::string Target;
|
|
|
|
|
2019-03-01 03:19:26 +01:00
|
|
|
void Enumeration(raw_ostream &OS, DenseMap<Record *, unsigned> &FeatureMap);
|
|
|
|
unsigned FeatureKeyValues(raw_ostream &OS,
|
|
|
|
const DenseMap<Record *, unsigned> &FeatureMap);
|
|
|
|
unsigned CPUKeyValues(raw_ostream &OS,
|
|
|
|
const DenseMap<Record *, unsigned> &FeatureMap);
|
2012-06-11 17:37:55 +02:00
|
|
|
void FormItineraryStageString(const std::string &Names,
|
|
|
|
Record *ItinData, std::string &ItinString,
|
|
|
|
unsigned &NStages);
|
|
|
|
void FormItineraryOperandCycleString(Record *ItinData, std::string &ItinString,
|
|
|
|
unsigned &NOperandCycles);
|
|
|
|
void FormItineraryBypassString(const std::string &Names,
|
|
|
|
Record *ItinData,
|
|
|
|
std::string &ItinString, unsigned NOperandCycles);
|
2012-07-07 06:00:00 +02:00
|
|
|
void EmitStageAndOperandCycleData(raw_ostream &OS,
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<InstrItinerary>>
|
2012-07-07 06:00:00 +02:00
|
|
|
&ProcItinLists);
|
|
|
|
void EmitItineraries(raw_ostream &OS,
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<InstrItinerary>>
|
2012-07-07 06:00:00 +02:00
|
|
|
&ProcItinLists);
|
2018-04-04 13:53:13 +02:00
|
|
|
unsigned EmitRegisterFileTables(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS);
|
[llvm-mca][MC] Add the ability to declare which processor resources model load/store queues (PR36666).
This patch adds the ability to specify via tablegen which processor resources
are load/store queue resources.
A new tablegen class named MemoryQueue can be optionally used to mark resources
that model load/store queues. Information about the load/store queue is
collected at 'CodeGenSchedule' stage, and analyzed by the 'SubtargetEmitter' to
initialize two new fields in struct MCExtraProcessorInfo named `LoadQueueID` and
`StoreQueueID`. Those two fields are identifiers for buffered resources used to
describe the load queue and the store queue.
Field `BufferSize` is interpreted as the number of entries in the queue, while
the number of units is a throughput indicator (i.e. number of available pickers
for loads/stores).
At construction time, LSUnit in llvm-mca checks for the presence of extra
processor information (i.e. MCExtraProcessorInfo) in the scheduling model. If
that information is available, and fields LoadQueueID and StoreQueueID are set
to a value different than zero (i.e. the invalid processor resource index), then
LSUnit initializes its LoadQueue/StoreQueue based on the BufferSize value
declared by the two processor resources.
With this patch, we more accurately track dynamic dispatch stalls caused by the
lack of LS tokens (i.e. load/store queue full). This is also shown by the
differences in two BdVer2 tests. Stalls that were previously classified as
generic SCHEDULER FULL stalls, are not correctly classified either as "load
queue full" or "store queue full".
About the differences in the -scheduler-stats view: those differences are
expected, because entries in the load/store queue are not released at
instruction issue stage. Instead, those are released at instruction executed
stage. This is the main reason why for the modified tests, the load/store
queues gets full before PdEx is full.
Differential Revision: https://reviews.llvm.org/D54957
llvm-svn: 347857
2018-11-29 13:15:56 +01:00
|
|
|
void EmitLoadStoreQueueInfo(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS);
|
2018-04-04 13:53:13 +02:00
|
|
|
void EmitExtraProcessorInfo(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS);
|
2016-10-05 01:47:33 +02:00
|
|
|
void EmitProcessorProp(raw_ostream &OS, const Record *R, StringRef Name,
|
2012-06-11 17:37:55 +02:00
|
|
|
char Separator);
|
2018-02-08 09:46:48 +01:00
|
|
|
void EmitProcessorResourceSubUnits(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS);
|
2012-09-18 00:18:45 +02:00
|
|
|
void EmitProcessorResources(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS);
|
2012-09-22 04:24:21 +02:00
|
|
|
Record *FindWriteResources(const CodeGenSchedRW &SchedWrite,
|
2012-09-18 00:18:48 +02:00
|
|
|
const CodeGenProcModel &ProcModel);
|
2012-09-22 04:24:21 +02:00
|
|
|
Record *FindReadAdvance(const CodeGenSchedRW &SchedRead,
|
|
|
|
const CodeGenProcModel &ProcModel);
|
2013-03-14 22:21:50 +01:00
|
|
|
void ExpandProcResources(RecVec &PRVec, std::vector<int64_t> &Cycles,
|
|
|
|
const CodeGenProcModel &ProcModel);
|
2012-09-18 00:18:48 +02:00
|
|
|
void GenSchedClassTables(const CodeGenProcModel &ProcModel,
|
|
|
|
SchedClassTables &SchedTables);
|
2012-09-18 00:18:50 +02:00
|
|
|
void EmitSchedClassTables(SchedClassTables &SchedTables, raw_ostream &OS);
|
2012-07-07 06:00:00 +02:00
|
|
|
void EmitProcessorModels(raw_ostream &OS);
|
2016-06-08 21:09:22 +02:00
|
|
|
void EmitSchedModelHelpers(const std::string &ClassName, raw_ostream &OS);
|
2018-05-25 17:55:37 +02:00
|
|
|
void emitSchedModelHelpersImpl(raw_ostream &OS,
|
|
|
|
bool OnlyExpandMCInstPredicates = false);
|
2018-05-25 18:02:43 +02:00
|
|
|
void emitGenMCSubtargetInfo(raw_ostream &OS);
|
[TableGen][SubtargetEmitter] Add the ability for processor models to describe dependency breaking instructions.
This patch adds the ability for processor models to describe dependency breaking
instructions.
Different processors may specify a different set of dependency-breaking
instructions.
That means, we cannot assume that all processors of the same target would use
the same rules to classify dependency breaking instructions.
The main goal of this patch is to provide the means to describe dependency
breaking instructions directly via tablegen, and have the following
TargetSubtargetInfo hooks redefined in overrides by tabegen'd
XXXGenSubtargetInfo classes (here, XXX is a Target name).
```
virtual bool isZeroIdiom(const MachineInstr *MI, APInt &Mask) const {
return false;
}
virtual bool isDependencyBreaking(const MachineInstr *MI, APInt &Mask) const {
return isZeroIdiom(MI);
}
```
An instruction MI is a dependency-breaking instruction if a call to method
isDependencyBreaking(MI) on the STI (TargetSubtargetInfo object) evaluates to
true. Similarly, an instruction MI is a special case of zero-idiom dependency
breaking instruction if a call to STI.isZeroIdiom(MI) returns true.
The extra APInt is used for those targets that may want to select which machine
operands have their dependency broken (see comments in code).
Note that by default, subtargets don't know about the existence of
dependency-breaking. In the absence of external information, those method calls
would always return false.
A new tablegen class named STIPredicate has been added by this patch to let
processor models classify instructions that have properties in common. The idea
is that, a MCInstrPredicate definition can be used to "generate" an instruction
equivalence class, with the idea that instructions of a same class all have a
property in common.
STIPredicate definitions are essentially a collection of instruction equivalence
classes.
Also, different processor models can specify a different variant of the same
STIPredicate with different rules (i.e. predicates) to classify instructions.
Tablegen backends (in this particular case, the SubtargetEmitter) will be able
to process STIPredicate definitions, and automatically generate functions in
XXXGenSubtargetInfo.
This patch introduces two special kind of STIPredicate classes named
IsZeroIdiomFunction and IsDepBreakingFunction in tablegen. It also adds a
definition for those in the BtVer2 scheduling model only.
This patch supersedes the one committed at r338372 (phabricator review: D49310).
The main advantages are:
- We can describe subtarget predicates via tablegen using STIPredicates.
- We can describe zero-idioms / dep-breaking instructions directly via
tablegen in the scheduling models.
In future, the STIPredicates framework can be used for solving other problems.
Examples of future developments are:
- Teach how to identify optimizable register-register moves
- Teach how to identify slow LEA instructions (each subtarget defining its own
concept of "slow" LEA).
- Teach how to identify instructions that have undocumented false dependencies
on the output registers on some processors only.
It is also (in my opinion) an elegant way to expose knowledge to both external
tools like llvm-mca, and codegen passes.
For example, machine schedulers in LLVM could reuse that information when
internally constructing the data dependency graph for a code region.
This new design feature is also an "opt-in" feature. Processor models don't have
to use the new STIPredicates. It has all been designed to be as unintrusive as
possible.
Differential Revision: https://reviews.llvm.org/D52174
llvm-svn: 342555
2018-09-19 17:57:45 +02:00
|
|
|
void EmitMCInstrAnalysisPredicateFunctions(raw_ostream &OS);
|
2018-05-25 17:55:37 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
void EmitSchedModel(raw_ostream &OS);
|
2017-09-14 22:44:20 +02:00
|
|
|
void EmitHwModeCheck(const std::string &ClassName, raw_ostream &OS);
|
2012-06-11 17:37:55 +02:00
|
|
|
void ParseFeaturesFunction(raw_ostream &OS, unsigned NumFeatures,
|
|
|
|
unsigned NumProcs);
|
|
|
|
|
|
|
|
public:
|
2017-09-14 22:44:20 +02:00
|
|
|
SubtargetEmitter(RecordKeeper &R, CodeGenTarget &TGT)
|
2020-01-28 20:23:46 +01:00
|
|
|
: TGT(TGT), Records(R), SchedModels(TGT.getSchedModels()),
|
|
|
|
Target(TGT.getName()) {}
|
2012-06-11 17:37:55 +02:00
|
|
|
|
|
|
|
void run(raw_ostream &o);
|
|
|
|
};
|
2016-05-17 19:04:23 +02:00
|
|
|
|
2015-10-07 01:24:35 +02:00
|
|
|
} // end anonymous namespace
|
2012-06-11 17:37:55 +02:00
|
|
|
|
2005-10-21 21:00:04 +02:00
|
|
|
//
|
2005-10-26 19:30:34 +02:00
|
|
|
// Enumeration - Emit the specified class as an enumeration.
|
2005-10-25 17:16:36 +02:00
|
|
|
//
|
2019-03-01 03:19:26 +01:00
|
|
|
void SubtargetEmitter::Enumeration(raw_ostream &OS,
|
|
|
|
DenseMap<Record *, unsigned> &FeatureMap) {
|
2005-10-28 17:20:43 +02:00
|
|
|
// Get all records of class and sort
|
2016-02-14 06:22:01 +01:00
|
|
|
std::vector<Record*> DefList =
|
|
|
|
Records.getAllDerivedDefinitions("SubtargetFeature");
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(DefList, LessRecord());
|
2005-10-21 21:00:04 +02:00
|
|
|
|
2011-04-15 21:35:46 +02:00
|
|
|
unsigned N = DefList.size();
|
2011-07-01 22:45:01 +02:00
|
|
|
if (N == 0)
|
|
|
|
return;
|
[WebAssembly] Merge used feature sets, update atomics linkage policy
Summary:
It does not currently make sense to use WebAssembly features in some functions
but not others, so this CL adds an IR pass that takes the union of all used
feature sets and applies it to each function in the module. This allows us to
prevent atomics from being lowered away if some function has opted in to using
them. When atomics is not enabled anywhere, we detect whether there exists any
atomic operations or thread local storage that would be stripped and disallow
linking with objects that contain atomics if and only if atomics or tls are
stripped. When atomics is enabled, mark it as used but do not require it of
other objects in the link. These changes allow libraries that do not use atomics
to be built once and linked into both single-threaded and multithreaded
binaries.
Reviewers: aheejin, sbc100, dschuff
Subscribers: jgravelle-google, hiraditya, sunfish, jfb, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D59625
llvm-svn: 357226
2019-03-29 01:14:01 +01:00
|
|
|
if (N + 1 > MAX_SUBTARGET_FEATURES)
|
2015-05-26 12:47:10 +02:00
|
|
|
PrintFatalError("Too many subtarget features! Bump MAX_SUBTARGET_FEATURES.");
|
2011-04-15 21:35:46 +02:00
|
|
|
|
2011-07-01 22:45:01 +02:00
|
|
|
OS << "namespace " << Target << " {\n";
|
|
|
|
|
2016-02-13 18:58:14 +01:00
|
|
|
// Open enumeration.
|
2016-02-13 07:03:29 +01:00
|
|
|
OS << "enum {\n";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2015-03-09 21:23:14 +01:00
|
|
|
// For each record
|
2017-10-24 17:50:53 +02:00
|
|
|
for (unsigned i = 0; i < N; ++i) {
|
2015-03-09 21:23:14 +01:00
|
|
|
// Next record
|
|
|
|
Record *Def = DefList[i];
|
2015-02-19 12:38:11 +01:00
|
|
|
|
2015-03-09 21:23:14 +01:00
|
|
|
// Get and emit name
|
2017-10-24 17:50:53 +02:00
|
|
|
OS << " " << Def->getName() << " = " << i << ",\n";
|
2019-03-01 03:19:26 +01:00
|
|
|
|
|
|
|
// Save the index for this feature.
|
|
|
|
FeatureMap[Def] = i;
|
2012-01-04 00:04:28 +01:00
|
|
|
}
|
2011-07-01 22:45:01 +02:00
|
|
|
|
[WebAssembly] Merge used feature sets, update atomics linkage policy
Summary:
It does not currently make sense to use WebAssembly features in some functions
but not others, so this CL adds an IR pass that takes the union of all used
feature sets and applies it to each function in the module. This allows us to
prevent atomics from being lowered away if some function has opted in to using
them. When atomics is not enabled anywhere, we detect whether there exists any
atomic operations or thread local storage that would be stripped and disallow
linking with objects that contain atomics if and only if atomics or tls are
stripped. When atomics is enabled, mark it as used but do not require it of
other objects in the link. These changes allow libraries that do not use atomics
to be built once and linked into both single-threaded and multithreaded
binaries.
Reviewers: aheejin, sbc100, dschuff
Subscribers: jgravelle-google, hiraditya, sunfish, jfb, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D59625
llvm-svn: 357226
2019-03-29 01:14:01 +01:00
|
|
|
OS << " "
|
|
|
|
<< "NumSubtargetFeatures = " << N << "\n";
|
|
|
|
|
2015-05-26 12:47:10 +02:00
|
|
|
// Close enumeration and namespace
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "};\n";
|
|
|
|
OS << "} // end namespace " << Target << "\n";
|
2005-10-25 17:16:36 +02:00
|
|
|
}
|
|
|
|
|
2019-03-01 03:19:26 +01:00
|
|
|
static void printFeatureMask(raw_ostream &OS, RecVec &FeatureList,
|
|
|
|
const DenseMap<Record *, unsigned> &FeatureMap) {
|
|
|
|
std::array<uint64_t, MAX_SUBTARGET_WORDS> Mask = {};
|
2021-02-02 05:55:08 +01:00
|
|
|
for (const Record *Feature : FeatureList) {
|
|
|
|
unsigned Bit = FeatureMap.lookup(Feature);
|
2019-03-01 03:19:26 +01:00
|
|
|
Mask[Bit / 64] |= 1ULL << (Bit % 64);
|
|
|
|
}
|
|
|
|
|
2019-03-04 20:23:37 +01:00
|
|
|
OS << "{ { { ";
|
2019-03-01 03:19:26 +01:00
|
|
|
for (unsigned i = 0; i != Mask.size(); ++i) {
|
|
|
|
OS << "0x";
|
|
|
|
OS.write_hex(Mask[i]);
|
|
|
|
OS << "ULL, ";
|
|
|
|
}
|
2019-03-04 20:23:37 +01:00
|
|
|
OS << "} } }";
|
2019-03-01 03:19:26 +01:00
|
|
|
}
|
|
|
|
|
2005-10-25 17:16:36 +02:00
|
|
|
//
|
2007-05-04 22:38:40 +02:00
|
|
|
// FeatureKeyValues - Emit data of all the subtarget features. Used by the
|
|
|
|
// command line.
|
2005-10-25 17:16:36 +02:00
|
|
|
//
|
2019-03-01 03:19:26 +01:00
|
|
|
unsigned SubtargetEmitter::FeatureKeyValues(
|
|
|
|
raw_ostream &OS, const DenseMap<Record *, unsigned> &FeatureMap) {
|
2005-10-28 17:20:43 +02:00
|
|
|
// Gather and sort all the features
|
2005-10-28 23:47:29 +02:00
|
|
|
std::vector<Record*> FeatureList =
|
|
|
|
Records.getAllDerivedDefinitions("SubtargetFeature");
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
if (FeatureList.empty())
|
|
|
|
return 0;
|
|
|
|
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(FeatureList, LessRecordFieldName());
|
2005-10-25 17:16:36 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// Begin feature table
|
2005-10-26 19:30:34 +02:00
|
|
|
OS << "// Sorted (by key) array of values for CPU features.\n"
|
2011-10-22 18:50:00 +02:00
|
|
|
<< "extern const llvm::SubtargetFeatureKV " << Target
|
|
|
|
<< "FeatureKV[] = {\n";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// For each feature
|
2011-07-01 22:45:01 +02:00
|
|
|
unsigned NumFeatures = 0;
|
2021-02-02 05:55:08 +01:00
|
|
|
for (const Record *Feature : FeatureList) {
|
2005-10-28 23:47:29 +02:00
|
|
|
// Next feature
|
2017-05-31 23:12:46 +02:00
|
|
|
StringRef Name = Feature->getName();
|
|
|
|
StringRef CommandLineName = Feature->getValueAsString("Name");
|
|
|
|
StringRef Desc = Feature->getValueAsString("Desc");
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2006-12-12 21:55:58 +01:00
|
|
|
if (CommandLineName.empty()) continue;
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2015-05-26 12:47:10 +02:00
|
|
|
// Emit as { "feature", "description", { featureEnum }, { i1 , i2 , ... , in } }
|
2005-10-25 17:16:36 +02:00
|
|
|
OS << " { "
|
2005-10-28 23:47:29 +02:00
|
|
|
<< "\"" << CommandLineName << "\", "
|
2005-10-25 17:16:36 +02:00
|
|
|
<< "\"" << Desc << "\", "
|
2019-02-18 07:46:17 +01:00
|
|
|
<< Target << "::" << Name << ", ";
|
2007-05-04 22:38:40 +02:00
|
|
|
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec ImpliesList = Feature->getValueAsListOfDefs("Implies");
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2019-03-01 03:19:26 +01:00
|
|
|
printFeatureMask(OS, ImpliesList, FeatureMap);
|
|
|
|
|
|
|
|
OS << " },\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
++NumFeatures;
|
2005-10-25 17:16:36 +02:00
|
|
|
}
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// End feature table
|
2005-10-25 17:16:36 +02:00
|
|
|
OS << "};\n";
|
|
|
|
|
2011-07-01 22:45:01 +02:00
|
|
|
return NumFeatures;
|
2005-10-25 17:16:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//
|
|
|
|
// CPUKeyValues - Emit data of all the subtarget processors. Used by command
|
|
|
|
// line.
|
|
|
|
//
|
2019-03-01 03:19:26 +01:00
|
|
|
unsigned
|
|
|
|
SubtargetEmitter::CPUKeyValues(raw_ostream &OS,
|
|
|
|
const DenseMap<Record *, unsigned> &FeatureMap) {
|
2005-10-28 17:20:43 +02:00
|
|
|
// Gather and sort processor information
|
2005-10-28 23:47:29 +02:00
|
|
|
std::vector<Record*> ProcessorList =
|
|
|
|
Records.getAllDerivedDefinitions("Processor");
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(ProcessorList, LessRecordFieldName());
|
2005-10-25 17:16:36 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// Begin processor table
|
2005-10-26 19:30:34 +02:00
|
|
|
OS << "// Sorted (by key) array of values for CPU subtype.\n"
|
2019-03-05 19:54:34 +01:00
|
|
|
<< "extern const llvm::SubtargetSubTypeKV " << Target
|
2011-10-22 18:50:00 +02:00
|
|
|
<< "SubTypeKV[] = {\n";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// For each processor
|
2017-10-24 17:50:53 +02:00
|
|
|
for (Record *Processor : ProcessorList) {
|
2017-05-31 23:12:46 +02:00
|
|
|
StringRef Name = Processor->getValueAsString("Name");
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec FeatureList = Processor->getValueAsListOfDefs("Features");
|
2020-08-14 23:56:54 +02:00
|
|
|
RecVec TuneFeatureList = Processor->getValueAsListOfDefs("TuneFeatures");
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2019-02-18 07:46:17 +01:00
|
|
|
// Emit as { "cpu", "description", 0, { f1 , f2 , ... fn } },
|
|
|
|
OS << " { "
|
2019-03-05 19:54:34 +01:00
|
|
|
<< "\"" << Name << "\", ";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2019-03-01 03:19:26 +01:00
|
|
|
printFeatureMask(OS, FeatureList, FeatureMap);
|
2020-08-14 23:56:54 +02:00
|
|
|
OS << ", ";
|
|
|
|
printFeatureMask(OS, TuneFeatureList, FeatureMap);
|
2019-03-01 03:19:26 +01:00
|
|
|
|
2019-03-05 19:54:38 +01:00
|
|
|
// Emit the scheduler model pointer.
|
|
|
|
const std::string &ProcModelName =
|
|
|
|
SchedModels.getModelForProc(Processor).ModelName;
|
|
|
|
OS << ", &" << ProcModelName << " },\n";
|
2005-10-21 21:00:04 +02:00
|
|
|
}
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// End processor table
|
2005-10-25 17:16:36 +02:00
|
|
|
OS << "};\n";
|
|
|
|
|
2011-07-01 22:45:01 +02:00
|
|
|
return ProcessorList.size();
|
2005-10-21 21:00:04 +02:00
|
|
|
}
|
2005-10-25 17:16:36 +02:00
|
|
|
|
2005-10-27 21:47:21 +02:00
|
|
|
//
|
2009-08-17 18:02:57 +02:00
|
|
|
// FormItineraryStageString - Compose a string containing the stage
|
|
|
|
// data initialization for the specified itinerary. N is the number
|
|
|
|
// of stages.
|
2005-10-27 21:47:21 +02:00
|
|
|
//
|
2010-04-18 22:31:01 +02:00
|
|
|
void SubtargetEmitter::FormItineraryStageString(const std::string &Name,
|
|
|
|
Record *ItinData,
|
2009-08-17 18:02:57 +02:00
|
|
|
std::string &ItinString,
|
|
|
|
unsigned &NStages) {
|
2005-10-28 23:47:29 +02:00
|
|
|
// Get states list
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec StageList = ItinData->getValueAsListOfDefs("Stages");
|
2005-10-28 17:20:43 +02:00
|
|
|
|
|
|
|
// For each stage
|
2005-10-28 23:47:29 +02:00
|
|
|
unsigned N = NStages = StageList.size();
|
2007-04-22 11:04:24 +02:00
|
|
|
for (unsigned i = 0; i < N;) {
|
2005-10-28 23:47:29 +02:00
|
|
|
// Next stage
|
2007-05-04 22:38:40 +02:00
|
|
|
const Record *Stage = StageList[i];
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2010-04-07 20:19:32 +02:00
|
|
|
// Form string as ,{ cycles, u1 | u2 | ... | un, timeinc, kind }
|
2005-10-27 21:47:21 +02:00
|
|
|
int Cycles = Stage->getValueAsInt("Cycles");
|
2005-11-03 23:47:41 +01:00
|
|
|
ItinString += " { " + itostr(Cycles) + ", ";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 23:47:29 +02:00
|
|
|
// Get unit list
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec UnitList = Stage->getValueAsListOfDefs("Units");
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// For each unit
|
2005-10-28 23:47:29 +02:00
|
|
|
for (unsigned j = 0, M = UnitList.size(); j < M;) {
|
|
|
|
// Add name and bitwise or
|
2016-12-04 06:48:16 +01:00
|
|
|
ItinString += Name + "FU::" + UnitList[j]->getName().str();
|
2005-10-28 23:47:29 +02:00
|
|
|
if (++j < M) ItinString += " | ";
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2009-08-12 20:31:53 +02:00
|
|
|
int TimeInc = Stage->getValueAsInt("TimeInc");
|
|
|
|
ItinString += ", " + itostr(TimeInc);
|
|
|
|
|
2010-04-07 20:19:32 +02:00
|
|
|
int Kind = Stage->getValueAsInt("Kind");
|
|
|
|
ItinString += ", (llvm::InstrStage::ReservationKinds)" + itostr(Kind);
|
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// Close off stage
|
|
|
|
ItinString += " }";
|
2007-04-22 11:04:24 +02:00
|
|
|
if (++i < N) ItinString += ", ";
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//
|
2009-08-17 18:02:57 +02:00
|
|
|
// FormItineraryOperandCycleString - Compose a string containing the
|
|
|
|
// operand cycle initialization for the specified itinerary. N is the
|
|
|
|
// number of operands that has cycles specified.
|
2005-10-27 21:47:21 +02:00
|
|
|
//
|
2009-08-17 18:02:57 +02:00
|
|
|
void SubtargetEmitter::FormItineraryOperandCycleString(Record *ItinData,
|
|
|
|
std::string &ItinString, unsigned &NOperandCycles) {
|
|
|
|
// Get operand cycle list
|
2018-03-23 01:02:45 +01:00
|
|
|
std::vector<int64_t> OperandCycleList =
|
2009-08-17 18:02:57 +02:00
|
|
|
ItinData->getValueAsListOfInts("OperandCycles");
|
|
|
|
|
|
|
|
// For each operand cycle
|
2021-02-20 07:44:12 +01:00
|
|
|
NOperandCycles = OperandCycleList.size();
|
|
|
|
ListSeparator LS;
|
|
|
|
for (int OCycle : OperandCycleList) {
|
2009-08-17 18:02:57 +02:00
|
|
|
// Next operand cycle
|
2021-02-20 07:44:12 +01:00
|
|
|
ItinString += LS;
|
2009-08-17 18:02:57 +02:00
|
|
|
ItinString += " " + itostr(OCycle);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-09-29 01:50:49 +02:00
|
|
|
void SubtargetEmitter::FormItineraryBypassString(const std::string &Name,
|
|
|
|
Record *ItinData,
|
|
|
|
std::string &ItinString,
|
|
|
|
unsigned NOperandCycles) {
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec BypassList = ItinData->getValueAsListOfDefs("Bypasses");
|
2010-09-29 01:50:49 +02:00
|
|
|
unsigned N = BypassList.size();
|
2010-09-30 00:42:35 +02:00
|
|
|
unsigned i = 0;
|
2021-02-20 07:44:12 +01:00
|
|
|
ListSeparator LS;
|
|
|
|
for (; i < N; ++i) {
|
|
|
|
ItinString += LS;
|
2016-12-04 06:48:16 +01:00
|
|
|
ItinString += Name + "Bypass::" + BypassList[i]->getName().str();
|
2010-09-29 01:50:49 +02:00
|
|
|
}
|
2021-02-20 07:44:12 +01:00
|
|
|
for (; i < NOperandCycles; ++i) {
|
|
|
|
ItinString += LS;
|
2010-09-29 01:50:49 +02:00
|
|
|
ItinString += " 0";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-08-17 18:02:57 +02:00
|
|
|
//
|
2012-07-07 06:00:00 +02:00
|
|
|
// EmitStageAndOperandCycleData - Generate unique itinerary stages and operand
|
|
|
|
// cycle tables. Create a list of InstrItinerary objects (ProcItinLists) indexed
|
|
|
|
// by CodeGenSchedClass::Index.
|
2009-08-17 18:02:57 +02:00
|
|
|
//
|
2012-07-07 06:00:00 +02:00
|
|
|
void SubtargetEmitter::
|
|
|
|
EmitStageAndOperandCycleData(raw_ostream &OS,
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<InstrItinerary>>
|
2012-07-07 06:00:00 +02:00
|
|
|
&ProcItinLists) {
|
2012-07-09 22:43:03 +02:00
|
|
|
// Multiple processor models may share an itinerary record. Emit it once.
|
|
|
|
SmallPtrSet<Record*, 8> ItinsDefSet;
|
|
|
|
|
2010-04-18 22:31:01 +02:00
|
|
|
// Emit functional units for all the itineraries.
|
2016-02-13 07:03:32 +01:00
|
|
|
for (const CodeGenProcModel &ProcModel : SchedModels.procModels()) {
|
2010-04-18 22:31:01 +02:00
|
|
|
|
2016-02-13 07:03:32 +01:00
|
|
|
if (!ItinsDefSet.insert(ProcModel.ItinsDef).second)
|
2012-07-09 22:43:03 +02:00
|
|
|
continue;
|
|
|
|
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec FUs = ProcModel.ItinsDef->getValueAsListOfDefs("FU");
|
2010-04-18 22:31:01 +02:00
|
|
|
if (FUs.empty())
|
|
|
|
continue;
|
|
|
|
|
2017-07-05 22:14:54 +02:00
|
|
|
StringRef Name = ProcModel.ItinsDef->getName();
|
2012-07-07 06:00:00 +02:00
|
|
|
OS << "\n// Functional units for \"" << Name << "\"\n"
|
2010-04-18 22:31:01 +02:00
|
|
|
<< "namespace " << Name << "FU {\n";
|
|
|
|
|
|
|
|
for (unsigned j = 0, FUN = FUs.size(); j < FUN; ++j)
|
2019-12-09 16:22:57 +01:00
|
|
|
OS << " const InstrStage::FuncUnits " << FUs[j]->getName()
|
|
|
|
<< " = 1ULL << " << j << ";\n";
|
2010-04-18 22:31:01 +02:00
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "} // end namespace " << Name << "FU\n";
|
2010-09-29 01:50:49 +02:00
|
|
|
|
2018-03-23 01:02:45 +01:00
|
|
|
RecVec BPs = ProcModel.ItinsDef->getValueAsListOfDefs("BP");
|
2015-01-15 12:41:30 +01:00
|
|
|
if (!BPs.empty()) {
|
2018-03-17 18:30:08 +01:00
|
|
|
OS << "\n// Pipeline forwarding paths for itineraries \"" << Name
|
2010-09-30 00:42:35 +02:00
|
|
|
<< "\"\n" << "namespace " << Name << "Bypass {\n";
|
2010-09-29 01:50:49 +02:00
|
|
|
|
2011-10-22 18:50:00 +02:00
|
|
|
OS << " const unsigned NoBypass = 0;\n";
|
2010-09-30 00:42:35 +02:00
|
|
|
for (unsigned j = 0, BPN = BPs.size(); j < BPN; ++j)
|
2011-10-22 18:50:00 +02:00
|
|
|
OS << " const unsigned " << BPs[j]->getName()
|
2010-09-30 00:42:35 +02:00
|
|
|
<< " = 1 << " << j << ";\n";
|
2010-09-29 01:50:49 +02:00
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "} // end namespace " << Name << "Bypass\n";
|
2010-09-30 00:42:35 +02:00
|
|
|
}
|
2010-04-18 22:31:01 +02:00
|
|
|
}
|
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// Begin stages table
|
2011-10-22 18:50:00 +02:00
|
|
|
std::string StageTable = "\nextern const llvm::InstrStage " + Target +
|
|
|
|
"Stages[] = {\n";
|
2010-04-07 20:19:32 +02:00
|
|
|
StageTable += " { 0, 0, 0, llvm::InstrStage::Required }, // No itinerary\n";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2009-08-17 18:02:57 +02:00
|
|
|
// Begin operand cycle table
|
2011-10-22 18:50:00 +02:00
|
|
|
std::string OperandCycleTable = "extern const unsigned " + Target +
|
2011-07-01 22:45:01 +02:00
|
|
|
"OperandCycles[] = {\n";
|
2009-08-17 18:02:57 +02:00
|
|
|
OperandCycleTable += " 0, // No itinerary\n";
|
2010-09-29 01:50:49 +02:00
|
|
|
|
|
|
|
// Begin pipeline bypass table
|
2011-10-22 18:50:00 +02:00
|
|
|
std::string BypassTable = "extern const unsigned " + Target +
|
2012-07-07 05:59:48 +02:00
|
|
|
"ForwardingPaths[] = {\n";
|
2012-07-07 06:00:00 +02:00
|
|
|
BypassTable += " 0, // No itinerary\n";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
// For each Itinerary across all processors, add a unique entry to the stages,
|
2017-05-08 17:33:08 +02:00
|
|
|
// operand cycles, and pipeline bypass tables. Then add the new Itinerary
|
2012-07-07 06:00:00 +02:00
|
|
|
// object with computed offsets to the ProcItinLists result.
|
2009-08-17 18:02:57 +02:00
|
|
|
unsigned StageCount = 1, OperandCycleCount = 1;
|
2010-09-30 00:42:35 +02:00
|
|
|
std::map<std::string, unsigned> ItinStageMap, ItinOperandMap;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (const CodeGenProcModel &ProcModel : SchedModels.procModels()) {
|
2012-07-07 06:00:00 +02:00
|
|
|
// Add process itinerary to the list.
|
|
|
|
ProcItinLists.resize(ProcItinLists.size()+1);
|
2012-06-22 05:58:51 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
// If this processor defines no itineraries, then leave the itinerary list
|
|
|
|
// empty.
|
|
|
|
std::vector<InstrItinerary> &ItinList = ProcItinLists.back();
|
2013-03-16 19:58:55 +01:00
|
|
|
if (!ProcModel.hasItineraries())
|
2012-06-22 05:58:51 +02:00
|
|
|
continue;
|
|
|
|
|
2017-07-05 22:14:54 +02:00
|
|
|
StringRef Name = ProcModel.ItinsDef->getName();
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2013-03-16 19:58:55 +01:00
|
|
|
ItinList.resize(SchedModels.numInstrSchedClasses());
|
|
|
|
assert(ProcModel.ItinDefList.size() == ItinList.size() && "bad Itins");
|
|
|
|
|
|
|
|
for (unsigned SchedClassIdx = 0, SchedClassEnd = ItinList.size();
|
2012-07-07 06:00:00 +02:00
|
|
|
SchedClassIdx < SchedClassEnd; ++SchedClassIdx) {
|
|
|
|
|
2005-10-28 23:47:29 +02:00
|
|
|
// Next itinerary data
|
2012-07-07 06:00:00 +02:00
|
|
|
Record *ItinData = ProcModel.ItinDefList[SchedClassIdx];
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// Get string and stage count
|
2009-08-17 18:02:57 +02:00
|
|
|
std::string ItinStageString;
|
2012-07-07 06:00:00 +02:00
|
|
|
unsigned NStages = 0;
|
|
|
|
if (ItinData)
|
2020-01-28 20:23:46 +01:00
|
|
|
FormItineraryStageString(std::string(Name), ItinData, ItinStageString,
|
|
|
|
NStages);
|
2009-08-17 18:02:57 +02:00
|
|
|
|
|
|
|
// Get string and operand cycle count
|
|
|
|
std::string ItinOperandCycleString;
|
2012-07-07 06:00:00 +02:00
|
|
|
unsigned NOperandCycles = 0;
|
2010-09-29 01:50:49 +02:00
|
|
|
std::string ItinBypassString;
|
2012-07-07 06:00:00 +02:00
|
|
|
if (ItinData) {
|
|
|
|
FormItineraryOperandCycleString(ItinData, ItinOperandCycleString,
|
|
|
|
NOperandCycles);
|
|
|
|
|
2020-01-28 20:23:46 +01:00
|
|
|
FormItineraryBypassString(std::string(Name), ItinData, ItinBypassString,
|
2012-07-07 06:00:00 +02:00
|
|
|
NOperandCycles);
|
|
|
|
}
|
2010-09-29 01:50:49 +02:00
|
|
|
|
2009-08-17 18:02:57 +02:00
|
|
|
// Check to see if stage already exists and create if it doesn't
|
2018-02-23 20:32:56 +01:00
|
|
|
uint16_t FindStage = 0;
|
2009-08-17 18:02:57 +02:00
|
|
|
if (NStages > 0) {
|
|
|
|
FindStage = ItinStageMap[ItinStageString];
|
|
|
|
if (FindStage == 0) {
|
2011-04-01 04:22:47 +02:00
|
|
|
// Emit as { cycles, u1 | u2 | ... | un, timeinc }, // indices
|
|
|
|
StageTable += ItinStageString + ", // " + itostr(StageCount);
|
|
|
|
if (NStages > 1)
|
|
|
|
StageTable += "-" + itostr(StageCount + NStages - 1);
|
|
|
|
StageTable += "\n";
|
2009-08-17 18:02:57 +02:00
|
|
|
// Record Itin class number.
|
|
|
|
ItinStageMap[ItinStageString] = FindStage = StageCount;
|
|
|
|
StageCount += NStages;
|
|
|
|
}
|
|
|
|
}
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2009-08-17 18:02:57 +02:00
|
|
|
// Check to see if operand cycle already exists and create if it doesn't
|
2018-02-23 20:32:56 +01:00
|
|
|
uint16_t FindOperandCycle = 0;
|
2009-08-17 18:02:57 +02:00
|
|
|
if (NOperandCycles > 0) {
|
2010-09-30 00:42:35 +02:00
|
|
|
std::string ItinOperandString = ItinOperandCycleString+ItinBypassString;
|
|
|
|
FindOperandCycle = ItinOperandMap[ItinOperandString];
|
2009-08-17 18:02:57 +02:00
|
|
|
if (FindOperandCycle == 0) {
|
|
|
|
// Emit as cycle, // index
|
2011-04-01 04:22:47 +02:00
|
|
|
OperandCycleTable += ItinOperandCycleString + ", // ";
|
|
|
|
std::string OperandIdxComment = itostr(OperandCycleCount);
|
|
|
|
if (NOperandCycles > 1)
|
|
|
|
OperandIdxComment += "-"
|
|
|
|
+ itostr(OperandCycleCount + NOperandCycles - 1);
|
|
|
|
OperandCycleTable += OperandIdxComment + "\n";
|
2009-08-17 18:02:57 +02:00
|
|
|
// Record Itin class number.
|
2011-04-01 03:56:55 +02:00
|
|
|
ItinOperandMap[ItinOperandCycleString] =
|
2009-08-17 18:02:57 +02:00
|
|
|
FindOperandCycle = OperandCycleCount;
|
2010-09-29 01:50:49 +02:00
|
|
|
// Emit as bypass, // index
|
2011-04-01 04:22:47 +02:00
|
|
|
BypassTable += ItinBypassString + ", // " + OperandIdxComment + "\n";
|
2009-08-17 18:02:57 +02:00
|
|
|
OperandCycleCount += NOperandCycles;
|
|
|
|
}
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2010-09-09 20:18:55 +02:00
|
|
|
// Set up itinerary as location and location + stage count
|
2018-02-23 20:32:56 +01:00
|
|
|
int16_t NumUOps = ItinData ? ItinData->getValueAsInt("NumMicroOps") : 0;
|
|
|
|
InstrItinerary Intinerary = {
|
|
|
|
NumUOps,
|
|
|
|
FindStage,
|
|
|
|
uint16_t(FindStage + NStages),
|
|
|
|
FindOperandCycle,
|
|
|
|
uint16_t(FindOperandCycle + NOperandCycles),
|
|
|
|
};
|
2010-09-09 20:18:55 +02:00
|
|
|
|
2005-10-28 17:20:43 +02:00
|
|
|
// Inject - empty slots will be 0, 0
|
2012-07-07 06:00:00 +02:00
|
|
|
ItinList[SchedClassIdx] = Intinerary;
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
|
|
|
}
|
2010-09-29 01:50:49 +02:00
|
|
|
|
2005-11-03 23:47:41 +01:00
|
|
|
// Closing stage
|
2012-07-07 06:00:00 +02:00
|
|
|
StageTable += " { 0, 0, 0, llvm::InstrStage::Required } // End stages\n";
|
2009-08-17 18:02:57 +02:00
|
|
|
StageTable += "};\n";
|
|
|
|
|
|
|
|
// Closing operand cycles
|
2012-07-07 06:00:00 +02:00
|
|
|
OperandCycleTable += " 0 // End operand cycles\n";
|
2009-08-17 18:02:57 +02:00
|
|
|
OperandCycleTable += "};\n";
|
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
BypassTable += " 0 // End bypass tables\n";
|
2010-09-29 01:50:49 +02:00
|
|
|
BypassTable += "};\n";
|
|
|
|
|
2009-08-17 18:02:57 +02:00
|
|
|
// Emit tables.
|
|
|
|
OS << StageTable;
|
|
|
|
OS << OperandCycleTable;
|
2010-09-29 01:50:49 +02:00
|
|
|
OS << BypassTable;
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//
|
2012-07-07 06:00:00 +02:00
|
|
|
// EmitProcessorData - Generate data for processor itineraries that were
|
|
|
|
// computed during EmitStageAndOperandCycleData(). ProcItinLists lists all
|
|
|
|
// Itineraries for each processor. The Itinerary lists are indexed on
|
|
|
|
// CodeGenSchedClass::Index.
|
2005-10-27 21:47:21 +02:00
|
|
|
//
|
2011-04-01 04:22:47 +02:00
|
|
|
void SubtargetEmitter::
|
2012-07-07 06:00:00 +02:00
|
|
|
EmitItineraries(raw_ostream &OS,
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<InstrItinerary>> &ProcItinLists) {
|
2012-07-09 22:43:03 +02:00
|
|
|
// Multiple processor models may share an itinerary record. Emit it once.
|
|
|
|
SmallPtrSet<Record*, 8> ItinsDefSet;
|
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
// For each processor's machine model
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<InstrItinerary>>::iterator
|
2012-07-07 06:00:00 +02:00
|
|
|
ProcItinListsIter = ProcItinLists.begin();
|
|
|
|
for (CodeGenSchedModels::ProcIter PI = SchedModels.procModelBegin(),
|
2012-09-15 02:19:57 +02:00
|
|
|
PE = SchedModels.procModelEnd(); PI != PE; ++PI, ++ProcItinListsIter) {
|
2012-07-09 22:43:03 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
Record *ItinsDef = PI->ItinsDef;
|
2014-11-19 08:49:26 +01:00
|
|
|
if (!ItinsDefSet.insert(ItinsDef).second)
|
2012-07-09 22:43:03 +02:00
|
|
|
continue;
|
2005-10-28 23:47:29 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
// Get the itinerary list for the processor.
|
|
|
|
assert(ProcItinListsIter != ProcItinLists.end() && "bad iterator");
|
2012-09-15 02:19:57 +02:00
|
|
|
std::vector<InstrItinerary> &ItinList = *ProcItinListsIter;
|
2012-06-05 05:44:40 +02:00
|
|
|
|
2014-09-03 01:23:34 +02:00
|
|
|
// Empty itineraries aren't referenced anywhere in the tablegen output
|
|
|
|
// so don't emit them.
|
|
|
|
if (ItinList.empty())
|
|
|
|
continue;
|
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
OS << "\n";
|
|
|
|
OS << "static const llvm::InstrItinerary ";
|
2011-04-01 03:56:55 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
// Begin processor itinerary table
|
2017-07-05 22:14:54 +02:00
|
|
|
OS << ItinsDef->getName() << "[] = {\n";
|
2012-07-07 06:00:00 +02:00
|
|
|
|
|
|
|
// For each itinerary class in CodeGenSchedClass::Index order.
|
|
|
|
for (unsigned j = 0, M = ItinList.size(); j < M; ++j) {
|
|
|
|
InstrItinerary &Intinerary = ItinList[j];
|
|
|
|
|
|
|
|
// Emit Itinerary in the form of
|
|
|
|
// { firstStage, lastStage, firstCycle, lastCycle } // index
|
|
|
|
OS << " { " <<
|
|
|
|
Intinerary.NumMicroOps << ", " <<
|
|
|
|
Intinerary.FirstStage << ", " <<
|
|
|
|
Intinerary.LastStage << ", " <<
|
|
|
|
Intinerary.FirstOperandCycle << ", " <<
|
|
|
|
Intinerary.LastOperandCycle << " }" <<
|
|
|
|
", // " << j << " " << SchedModels.getSchedClass(j).Name << "\n";
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
2012-07-07 06:00:00 +02:00
|
|
|
// End processor itinerary table
|
2018-02-23 20:32:56 +01:00
|
|
|
OS << " { 0, uint16_t(~0U), uint16_t(~0U), uint16_t(~0U), uint16_t(~0U) }"
|
|
|
|
"// end marker\n";
|
2012-06-05 05:44:40 +02:00
|
|
|
OS << "};\n";
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
2005-10-31 18:16:01 +01:00
|
|
|
}
|
|
|
|
|
2012-07-23 10:51:15 +02:00
|
|
|
// Emit either the value defined in the TableGen Record, or the default
|
2012-07-07 06:00:00 +02:00
|
|
|
// value defined in the C++ header. The Record is null if the processor does not
|
|
|
|
// define a model.
|
|
|
|
void SubtargetEmitter::EmitProcessorProp(raw_ostream &OS, const Record *R,
|
2016-10-05 01:47:33 +02:00
|
|
|
StringRef Name, char Separator) {
|
2012-07-07 06:00:00 +02:00
|
|
|
OS << " ";
|
|
|
|
int V = R ? R->getValueAsInt(Name) : -1;
|
|
|
|
if (V >= 0)
|
|
|
|
OS << V << Separator << " // " << Name;
|
|
|
|
else
|
|
|
|
OS << "MCSchedModel::Default" << Name << Separator;
|
|
|
|
OS << '\n';
|
|
|
|
}
|
|
|
|
|
2018-02-08 09:46:48 +01:00
|
|
|
void SubtargetEmitter::EmitProcessorResourceSubUnits(
|
|
|
|
const CodeGenProcModel &ProcModel, raw_ostream &OS) {
|
|
|
|
OS << "\nstatic const unsigned " << ProcModel.ModelName
|
|
|
|
<< "ProcResourceSubUnits[] = {\n"
|
|
|
|
<< " 0, // Invalid\n";
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = ProcModel.ProcResourceDefs.size(); i < e; ++i) {
|
|
|
|
Record *PRDef = ProcModel.ProcResourceDefs[i];
|
|
|
|
if (!PRDef->isSubClassOf("ProcResGroup"))
|
|
|
|
continue;
|
|
|
|
RecVec ResUnits = PRDef->getValueAsListOfDefs("Resources");
|
|
|
|
for (Record *RUDef : ResUnits) {
|
|
|
|
Record *const RU =
|
|
|
|
SchedModels.findProcResUnits(RUDef, ProcModel, PRDef->getLoc());
|
|
|
|
for (unsigned J = 0; J < RU->getValueAsInt("NumUnits"); ++J) {
|
|
|
|
OS << " " << ProcModel.getProcResourceIdx(RU) << ", ";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << " // " << PRDef->getName() << "\n";
|
|
|
|
}
|
|
|
|
OS << "};\n";
|
|
|
|
}
|
|
|
|
|
2018-04-05 17:41:41 +02:00
|
|
|
static void EmitRetireControlUnitInfo(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS) {
|
2018-04-05 17:53:31 +02:00
|
|
|
int64_t ReorderBufferSize = 0, MaxRetirePerCycle = 0;
|
2018-04-05 17:41:41 +02:00
|
|
|
if (Record *RCU = ProcModel.RetireControlUnit) {
|
|
|
|
ReorderBufferSize =
|
|
|
|
std::max(ReorderBufferSize, RCU->getValueAsInt("ReorderBufferSize"));
|
|
|
|
MaxRetirePerCycle =
|
|
|
|
std::max(MaxRetirePerCycle, RCU->getValueAsInt("MaxRetirePerCycle"));
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << ReorderBufferSize << ", // ReorderBufferSize\n ";
|
|
|
|
OS << MaxRetirePerCycle << ", // MaxRetirePerCycle\n ";
|
|
|
|
}
|
|
|
|
|
2018-04-04 13:53:13 +02:00
|
|
|
static void EmitRegisterFileInfo(const CodeGenProcModel &ProcModel,
|
|
|
|
unsigned NumRegisterFiles,
|
|
|
|
unsigned NumCostEntries, raw_ostream &OS) {
|
|
|
|
if (NumRegisterFiles)
|
|
|
|
OS << ProcModel.ModelName << "RegisterFiles,\n " << (1 + NumRegisterFiles);
|
|
|
|
else
|
2018-04-05 15:59:52 +02:00
|
|
|
OS << "nullptr,\n 0";
|
2018-04-04 13:53:13 +02:00
|
|
|
|
|
|
|
OS << ", // Number of register files.\n ";
|
|
|
|
if (NumCostEntries)
|
|
|
|
OS << ProcModel.ModelName << "RegisterCosts,\n ";
|
|
|
|
else
|
2018-04-05 15:59:52 +02:00
|
|
|
OS << "nullptr,\n ";
|
2018-04-10 10:16:37 +02:00
|
|
|
OS << NumCostEntries << ", // Number of register cost entries.\n";
|
2018-04-04 13:53:13 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned
|
|
|
|
SubtargetEmitter::EmitRegisterFileTables(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS) {
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
if (llvm::all_of(ProcModel.RegisterFiles, [](const CodeGenRegisterFile &RF) {
|
|
|
|
return RF.hasDefaultCosts();
|
|
|
|
}))
|
2018-04-04 13:53:13 +02:00
|
|
|
return 0;
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
|
|
|
|
// Print the RegisterCost table first.
|
[tblgen][llvm-mca] Add the ability to describe move elimination candidates via tablegen.
This patch adds the ability to identify instructions that are "move elimination
candidates". It also allows scheduling models to describe processor register
files that allow move elimination.
A move elimination candidate is an instruction that can be eliminated at
register renaming stage.
Each subtarget can specify which instructions are move elimination candidates
with the help of tablegen class "IsOptimizableRegisterMove" (see
llvm/Target/TargetInstrPredicate.td).
For example, on X86, BtVer2 allows both GPR and MMX/SSE moves to be eliminated.
The definition of 'IsOptimizableRegisterMove' for BtVer2 looks like this:
```
def : IsOptimizableRegisterMove<[
InstructionEquivalenceClass<[
// GPR variants.
MOV32rr, MOV64rr,
// MMX variants.
MMX_MOVQ64rr,
// SSE variants.
MOVAPSrr, MOVUPSrr,
MOVAPDrr, MOVUPDrr,
MOVDQArr, MOVDQUrr,
// AVX variants.
VMOVAPSrr, VMOVUPSrr,
VMOVAPDrr, VMOVUPDrr,
VMOVDQArr, VMOVDQUrr
], CheckNot<CheckSameRegOperand<0, 1>> >
]>;
```
Definitions of IsOptimizableRegisterMove from processor models of a same
Target are processed by the SubtargetEmitter to auto-generate a target-specific
override for each of the following predicate methods:
```
bool TargetSubtargetInfo::isOptimizableRegisterMove(const MachineInstr *MI)
const;
bool MCInstrAnalysis::isOptimizableRegisterMove(const MCInst &MI, unsigned
CPUID) const;
```
By default, those methods return false (i.e. conservatively assume that there
are no move elimination candidates).
Tablegen class RegisterFile has been extended with the following information:
- The set of register classes that allow move elimination.
- Maxium number of moves that can be eliminated every cycle.
- Whether move elimination is restricted to moves from registers that are
known to be zero.
This patch is structured in three part:
A first part (which is mostly boilerplate) adds the new
'isOptimizableRegisterMove' target hooks, and extends existing register file
descriptors in MC by introducing new fields to describe properties related to
move elimination.
A second part, uses the new tablegen constructs to describe move elimination in
the BtVer2 scheduling model.
A third part, teaches llm-mca how to query the new 'isOptimizableRegisterMove'
hook to mark instructions that are candidates for move elimination. It also
teaches class RegisterFile how to describe constraints on move elimination at
PRF granularity.
llvm-mca tests for btver2 show differences before/after this patch.
Differential Revision: https://reviews.llvm.org/D53134
llvm-svn: 344334
2018-10-12 13:23:04 +02:00
|
|
|
OS << "\n// {RegisterClassID, Register Cost, AllowMoveElimination }\n";
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
OS << "static const llvm::MCRegisterCostEntry " << ProcModel.ModelName
|
|
|
|
<< "RegisterCosts"
|
|
|
|
<< "[] = {\n";
|
|
|
|
|
|
|
|
for (const CodeGenRegisterFile &RF : ProcModel.RegisterFiles) {
|
|
|
|
// Skip register files with a default cost table.
|
|
|
|
if (RF.hasDefaultCosts())
|
|
|
|
continue;
|
|
|
|
// Add entries to the cost table.
|
|
|
|
for (const CodeGenRegisterCost &RC : RF.Costs) {
|
|
|
|
OS << " { ";
|
|
|
|
Record *Rec = RC.RCDef;
|
|
|
|
if (Rec->getValue("Namespace"))
|
|
|
|
OS << Rec->getValueAsString("Namespace") << "::";
|
[tblgen][llvm-mca] Add the ability to describe move elimination candidates via tablegen.
This patch adds the ability to identify instructions that are "move elimination
candidates". It also allows scheduling models to describe processor register
files that allow move elimination.
A move elimination candidate is an instruction that can be eliminated at
register renaming stage.
Each subtarget can specify which instructions are move elimination candidates
with the help of tablegen class "IsOptimizableRegisterMove" (see
llvm/Target/TargetInstrPredicate.td).
For example, on X86, BtVer2 allows both GPR and MMX/SSE moves to be eliminated.
The definition of 'IsOptimizableRegisterMove' for BtVer2 looks like this:
```
def : IsOptimizableRegisterMove<[
InstructionEquivalenceClass<[
// GPR variants.
MOV32rr, MOV64rr,
// MMX variants.
MMX_MOVQ64rr,
// SSE variants.
MOVAPSrr, MOVUPSrr,
MOVAPDrr, MOVUPDrr,
MOVDQArr, MOVDQUrr,
// AVX variants.
VMOVAPSrr, VMOVUPSrr,
VMOVAPDrr, VMOVUPDrr,
VMOVDQArr, VMOVDQUrr
], CheckNot<CheckSameRegOperand<0, 1>> >
]>;
```
Definitions of IsOptimizableRegisterMove from processor models of a same
Target are processed by the SubtargetEmitter to auto-generate a target-specific
override for each of the following predicate methods:
```
bool TargetSubtargetInfo::isOptimizableRegisterMove(const MachineInstr *MI)
const;
bool MCInstrAnalysis::isOptimizableRegisterMove(const MCInst &MI, unsigned
CPUID) const;
```
By default, those methods return false (i.e. conservatively assume that there
are no move elimination candidates).
Tablegen class RegisterFile has been extended with the following information:
- The set of register classes that allow move elimination.
- Maxium number of moves that can be eliminated every cycle.
- Whether move elimination is restricted to moves from registers that are
known to be zero.
This patch is structured in three part:
A first part (which is mostly boilerplate) adds the new
'isOptimizableRegisterMove' target hooks, and extends existing register file
descriptors in MC by introducing new fields to describe properties related to
move elimination.
A second part, uses the new tablegen constructs to describe move elimination in
the BtVer2 scheduling model.
A third part, teaches llm-mca how to query the new 'isOptimizableRegisterMove'
hook to mark instructions that are candidates for move elimination. It also
teaches class RegisterFile how to describe constraints on move elimination at
PRF granularity.
llvm-mca tests for btver2 show differences before/after this patch.
Differential Revision: https://reviews.llvm.org/D53134
llvm-svn: 344334
2018-10-12 13:23:04 +02:00
|
|
|
OS << Rec->getName() << "RegClassID, " << RC.Cost << ", "
|
|
|
|
<< RC.AllowMoveElimination << "},\n";
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
OS << "};\n";
|
|
|
|
|
|
|
|
// Now generate a table with register file info.
|
[tblgen][llvm-mca] Add the ability to describe move elimination candidates via tablegen.
This patch adds the ability to identify instructions that are "move elimination
candidates". It also allows scheduling models to describe processor register
files that allow move elimination.
A move elimination candidate is an instruction that can be eliminated at
register renaming stage.
Each subtarget can specify which instructions are move elimination candidates
with the help of tablegen class "IsOptimizableRegisterMove" (see
llvm/Target/TargetInstrPredicate.td).
For example, on X86, BtVer2 allows both GPR and MMX/SSE moves to be eliminated.
The definition of 'IsOptimizableRegisterMove' for BtVer2 looks like this:
```
def : IsOptimizableRegisterMove<[
InstructionEquivalenceClass<[
// GPR variants.
MOV32rr, MOV64rr,
// MMX variants.
MMX_MOVQ64rr,
// SSE variants.
MOVAPSrr, MOVUPSrr,
MOVAPDrr, MOVUPDrr,
MOVDQArr, MOVDQUrr,
// AVX variants.
VMOVAPSrr, VMOVUPSrr,
VMOVAPDrr, VMOVUPDrr,
VMOVDQArr, VMOVDQUrr
], CheckNot<CheckSameRegOperand<0, 1>> >
]>;
```
Definitions of IsOptimizableRegisterMove from processor models of a same
Target are processed by the SubtargetEmitter to auto-generate a target-specific
override for each of the following predicate methods:
```
bool TargetSubtargetInfo::isOptimizableRegisterMove(const MachineInstr *MI)
const;
bool MCInstrAnalysis::isOptimizableRegisterMove(const MCInst &MI, unsigned
CPUID) const;
```
By default, those methods return false (i.e. conservatively assume that there
are no move elimination candidates).
Tablegen class RegisterFile has been extended with the following information:
- The set of register classes that allow move elimination.
- Maxium number of moves that can be eliminated every cycle.
- Whether move elimination is restricted to moves from registers that are
known to be zero.
This patch is structured in three part:
A first part (which is mostly boilerplate) adds the new
'isOptimizableRegisterMove' target hooks, and extends existing register file
descriptors in MC by introducing new fields to describe properties related to
move elimination.
A second part, uses the new tablegen constructs to describe move elimination in
the BtVer2 scheduling model.
A third part, teaches llm-mca how to query the new 'isOptimizableRegisterMove'
hook to mark instructions that are candidates for move elimination. It also
teaches class RegisterFile how to describe constraints on move elimination at
PRF granularity.
llvm-mca tests for btver2 show differences before/after this patch.
Differential Revision: https://reviews.llvm.org/D53134
llvm-svn: 344334
2018-10-12 13:23:04 +02:00
|
|
|
OS << "\n // {Name, #PhysRegs, #CostEntries, IndexToCostTbl, "
|
|
|
|
<< "MaxMovesEliminatedPerCycle, AllowZeroMoveEliminationOnly }\n";
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
OS << "static const llvm::MCRegisterFileDesc " << ProcModel.ModelName
|
|
|
|
<< "RegisterFiles"
|
|
|
|
<< "[] = {\n"
|
[tblgen][llvm-mca] Add the ability to describe move elimination candidates via tablegen.
This patch adds the ability to identify instructions that are "move elimination
candidates". It also allows scheduling models to describe processor register
files that allow move elimination.
A move elimination candidate is an instruction that can be eliminated at
register renaming stage.
Each subtarget can specify which instructions are move elimination candidates
with the help of tablegen class "IsOptimizableRegisterMove" (see
llvm/Target/TargetInstrPredicate.td).
For example, on X86, BtVer2 allows both GPR and MMX/SSE moves to be eliminated.
The definition of 'IsOptimizableRegisterMove' for BtVer2 looks like this:
```
def : IsOptimizableRegisterMove<[
InstructionEquivalenceClass<[
// GPR variants.
MOV32rr, MOV64rr,
// MMX variants.
MMX_MOVQ64rr,
// SSE variants.
MOVAPSrr, MOVUPSrr,
MOVAPDrr, MOVUPDrr,
MOVDQArr, MOVDQUrr,
// AVX variants.
VMOVAPSrr, VMOVUPSrr,
VMOVAPDrr, VMOVUPDrr,
VMOVDQArr, VMOVDQUrr
], CheckNot<CheckSameRegOperand<0, 1>> >
]>;
```
Definitions of IsOptimizableRegisterMove from processor models of a same
Target are processed by the SubtargetEmitter to auto-generate a target-specific
override for each of the following predicate methods:
```
bool TargetSubtargetInfo::isOptimizableRegisterMove(const MachineInstr *MI)
const;
bool MCInstrAnalysis::isOptimizableRegisterMove(const MCInst &MI, unsigned
CPUID) const;
```
By default, those methods return false (i.e. conservatively assume that there
are no move elimination candidates).
Tablegen class RegisterFile has been extended with the following information:
- The set of register classes that allow move elimination.
- Maxium number of moves that can be eliminated every cycle.
- Whether move elimination is restricted to moves from registers that are
known to be zero.
This patch is structured in three part:
A first part (which is mostly boilerplate) adds the new
'isOptimizableRegisterMove' target hooks, and extends existing register file
descriptors in MC by introducing new fields to describe properties related to
move elimination.
A second part, uses the new tablegen constructs to describe move elimination in
the BtVer2 scheduling model.
A third part, teaches llm-mca how to query the new 'isOptimizableRegisterMove'
hook to mark instructions that are candidates for move elimination. It also
teaches class RegisterFile how to describe constraints on move elimination at
PRF granularity.
llvm-mca tests for btver2 show differences before/after this patch.
Differential Revision: https://reviews.llvm.org/D53134
llvm-svn: 344334
2018-10-12 13:23:04 +02:00
|
|
|
<< " { \"InvalidRegisterFile\", 0, 0, 0, 0, 0 },\n";
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
unsigned CostTblIndex = 0;
|
|
|
|
|
|
|
|
for (const CodeGenRegisterFile &RD : ProcModel.RegisterFiles) {
|
|
|
|
OS << " { ";
|
|
|
|
OS << '"' << RD.Name << '"' << ", " << RD.NumPhysRegs << ", ";
|
|
|
|
unsigned NumCostEntries = RD.Costs.size();
|
[tblgen][llvm-mca] Add the ability to describe move elimination candidates via tablegen.
This patch adds the ability to identify instructions that are "move elimination
candidates". It also allows scheduling models to describe processor register
files that allow move elimination.
A move elimination candidate is an instruction that can be eliminated at
register renaming stage.
Each subtarget can specify which instructions are move elimination candidates
with the help of tablegen class "IsOptimizableRegisterMove" (see
llvm/Target/TargetInstrPredicate.td).
For example, on X86, BtVer2 allows both GPR and MMX/SSE moves to be eliminated.
The definition of 'IsOptimizableRegisterMove' for BtVer2 looks like this:
```
def : IsOptimizableRegisterMove<[
InstructionEquivalenceClass<[
// GPR variants.
MOV32rr, MOV64rr,
// MMX variants.
MMX_MOVQ64rr,
// SSE variants.
MOVAPSrr, MOVUPSrr,
MOVAPDrr, MOVUPDrr,
MOVDQArr, MOVDQUrr,
// AVX variants.
VMOVAPSrr, VMOVUPSrr,
VMOVAPDrr, VMOVUPDrr,
VMOVDQArr, VMOVDQUrr
], CheckNot<CheckSameRegOperand<0, 1>> >
]>;
```
Definitions of IsOptimizableRegisterMove from processor models of a same
Target are processed by the SubtargetEmitter to auto-generate a target-specific
override for each of the following predicate methods:
```
bool TargetSubtargetInfo::isOptimizableRegisterMove(const MachineInstr *MI)
const;
bool MCInstrAnalysis::isOptimizableRegisterMove(const MCInst &MI, unsigned
CPUID) const;
```
By default, those methods return false (i.e. conservatively assume that there
are no move elimination candidates).
Tablegen class RegisterFile has been extended with the following information:
- The set of register classes that allow move elimination.
- Maxium number of moves that can be eliminated every cycle.
- Whether move elimination is restricted to moves from registers that are
known to be zero.
This patch is structured in three part:
A first part (which is mostly boilerplate) adds the new
'isOptimizableRegisterMove' target hooks, and extends existing register file
descriptors in MC by introducing new fields to describe properties related to
move elimination.
A second part, uses the new tablegen constructs to describe move elimination in
the BtVer2 scheduling model.
A third part, teaches llm-mca how to query the new 'isOptimizableRegisterMove'
hook to mark instructions that are candidates for move elimination. It also
teaches class RegisterFile how to describe constraints on move elimination at
PRF granularity.
llvm-mca tests for btver2 show differences before/after this patch.
Differential Revision: https://reviews.llvm.org/D53134
llvm-svn: 344334
2018-10-12 13:23:04 +02:00
|
|
|
OS << NumCostEntries << ", " << CostTblIndex << ", "
|
|
|
|
<< RD.MaxMovesEliminatedPerCycle << ", "
|
|
|
|
<< RD.AllowZeroMoveEliminationOnly << "},\n";
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
CostTblIndex += NumCostEntries;
|
|
|
|
}
|
|
|
|
OS << "};\n";
|
|
|
|
|
2018-04-04 13:53:13 +02:00
|
|
|
return CostTblIndex;
|
|
|
|
}
|
2018-04-19 12:59:49 +02:00
|
|
|
|
[llvm-mca][MC] Add the ability to declare which processor resources model load/store queues (PR36666).
This patch adds the ability to specify via tablegen which processor resources
are load/store queue resources.
A new tablegen class named MemoryQueue can be optionally used to mark resources
that model load/store queues. Information about the load/store queue is
collected at 'CodeGenSchedule' stage, and analyzed by the 'SubtargetEmitter' to
initialize two new fields in struct MCExtraProcessorInfo named `LoadQueueID` and
`StoreQueueID`. Those two fields are identifiers for buffered resources used to
describe the load queue and the store queue.
Field `BufferSize` is interpreted as the number of entries in the queue, while
the number of units is a throughput indicator (i.e. number of available pickers
for loads/stores).
At construction time, LSUnit in llvm-mca checks for the presence of extra
processor information (i.e. MCExtraProcessorInfo) in the scheduling model. If
that information is available, and fields LoadQueueID and StoreQueueID are set
to a value different than zero (i.e. the invalid processor resource index), then
LSUnit initializes its LoadQueue/StoreQueue based on the BufferSize value
declared by the two processor resources.
With this patch, we more accurately track dynamic dispatch stalls caused by the
lack of LS tokens (i.e. load/store queue full). This is also shown by the
differences in two BdVer2 tests. Stalls that were previously classified as
generic SCHEDULER FULL stalls, are not correctly classified either as "load
queue full" or "store queue full".
About the differences in the -scheduler-stats view: those differences are
expected, because entries in the load/store queue are not released at
instruction issue stage. Instead, those are released at instruction executed
stage. This is the main reason why for the modified tests, the load/store
queues gets full before PdEx is full.
Differential Revision: https://reviews.llvm.org/D54957
llvm-svn: 347857
2018-11-29 13:15:56 +01:00
|
|
|
void SubtargetEmitter::EmitLoadStoreQueueInfo(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS) {
|
|
|
|
unsigned QueueID = 0;
|
|
|
|
if (ProcModel.LoadQueue) {
|
|
|
|
const Record *Queue = ProcModel.LoadQueue->getValueAsDef("QueueDescriptor");
|
2021-01-20 05:19:14 +01:00
|
|
|
QueueID = 1 + std::distance(ProcModel.ProcResourceDefs.begin(),
|
|
|
|
find(ProcModel.ProcResourceDefs, Queue));
|
[llvm-mca][MC] Add the ability to declare which processor resources model load/store queues (PR36666).
This patch adds the ability to specify via tablegen which processor resources
are load/store queue resources.
A new tablegen class named MemoryQueue can be optionally used to mark resources
that model load/store queues. Information about the load/store queue is
collected at 'CodeGenSchedule' stage, and analyzed by the 'SubtargetEmitter' to
initialize two new fields in struct MCExtraProcessorInfo named `LoadQueueID` and
`StoreQueueID`. Those two fields are identifiers for buffered resources used to
describe the load queue and the store queue.
Field `BufferSize` is interpreted as the number of entries in the queue, while
the number of units is a throughput indicator (i.e. number of available pickers
for loads/stores).
At construction time, LSUnit in llvm-mca checks for the presence of extra
processor information (i.e. MCExtraProcessorInfo) in the scheduling model. If
that information is available, and fields LoadQueueID and StoreQueueID are set
to a value different than zero (i.e. the invalid processor resource index), then
LSUnit initializes its LoadQueue/StoreQueue based on the BufferSize value
declared by the two processor resources.
With this patch, we more accurately track dynamic dispatch stalls caused by the
lack of LS tokens (i.e. load/store queue full). This is also shown by the
differences in two BdVer2 tests. Stalls that were previously classified as
generic SCHEDULER FULL stalls, are not correctly classified either as "load
queue full" or "store queue full".
About the differences in the -scheduler-stats view: those differences are
expected, because entries in the load/store queue are not released at
instruction issue stage. Instead, those are released at instruction executed
stage. This is the main reason why for the modified tests, the load/store
queues gets full before PdEx is full.
Differential Revision: https://reviews.llvm.org/D54957
llvm-svn: 347857
2018-11-29 13:15:56 +01:00
|
|
|
}
|
|
|
|
OS << " " << QueueID << ", // Resource Descriptor for the Load Queue\n";
|
|
|
|
|
|
|
|
QueueID = 0;
|
|
|
|
if (ProcModel.StoreQueue) {
|
|
|
|
const Record *Queue =
|
|
|
|
ProcModel.StoreQueue->getValueAsDef("QueueDescriptor");
|
2021-01-20 05:19:14 +01:00
|
|
|
QueueID = 1 + std::distance(ProcModel.ProcResourceDefs.begin(),
|
|
|
|
find(ProcModel.ProcResourceDefs, Queue));
|
[llvm-mca][MC] Add the ability to declare which processor resources model load/store queues (PR36666).
This patch adds the ability to specify via tablegen which processor resources
are load/store queue resources.
A new tablegen class named MemoryQueue can be optionally used to mark resources
that model load/store queues. Information about the load/store queue is
collected at 'CodeGenSchedule' stage, and analyzed by the 'SubtargetEmitter' to
initialize two new fields in struct MCExtraProcessorInfo named `LoadQueueID` and
`StoreQueueID`. Those two fields are identifiers for buffered resources used to
describe the load queue and the store queue.
Field `BufferSize` is interpreted as the number of entries in the queue, while
the number of units is a throughput indicator (i.e. number of available pickers
for loads/stores).
At construction time, LSUnit in llvm-mca checks for the presence of extra
processor information (i.e. MCExtraProcessorInfo) in the scheduling model. If
that information is available, and fields LoadQueueID and StoreQueueID are set
to a value different than zero (i.e. the invalid processor resource index), then
LSUnit initializes its LoadQueue/StoreQueue based on the BufferSize value
declared by the two processor resources.
With this patch, we more accurately track dynamic dispatch stalls caused by the
lack of LS tokens (i.e. load/store queue full). This is also shown by the
differences in two BdVer2 tests. Stalls that were previously classified as
generic SCHEDULER FULL stalls, are not correctly classified either as "load
queue full" or "store queue full".
About the differences in the -scheduler-stats view: those differences are
expected, because entries in the load/store queue are not released at
instruction issue stage. Instead, those are released at instruction executed
stage. This is the main reason why for the modified tests, the load/store
queues gets full before PdEx is full.
Differential Revision: https://reviews.llvm.org/D54957
llvm-svn: 347857
2018-11-29 13:15:56 +01:00
|
|
|
}
|
|
|
|
OS << " " << QueueID << ", // Resource Descriptor for the Store Queue\n";
|
|
|
|
}
|
|
|
|
|
2018-04-04 13:53:13 +02:00
|
|
|
void SubtargetEmitter::EmitExtraProcessorInfo(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS) {
|
|
|
|
// Generate a table of register file descriptors (one entry per each user
|
|
|
|
// defined register file), and a table of register costs.
|
|
|
|
unsigned NumCostEntries = EmitRegisterFileTables(ProcModel, OS);
|
|
|
|
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
// Now generate a table for the extra processor info.
|
|
|
|
OS << "\nstatic const llvm::MCExtraProcessorInfo " << ProcModel.ModelName
|
2018-04-04 13:53:13 +02:00
|
|
|
<< "ExtraInfo = {\n ";
|
|
|
|
|
2018-04-05 17:41:41 +02:00
|
|
|
// Add information related to the retire control unit.
|
|
|
|
EmitRetireControlUnitInfo(ProcModel, OS);
|
|
|
|
|
2018-04-04 13:53:13 +02:00
|
|
|
// Add information related to the register files (i.e. where to find register
|
|
|
|
// file descriptors and register costs).
|
|
|
|
EmitRegisterFileInfo(ProcModel, ProcModel.RegisterFiles.size(),
|
|
|
|
NumCostEntries, OS);
|
|
|
|
|
[llvm-mca][MC] Add the ability to declare which processor resources model load/store queues (PR36666).
This patch adds the ability to specify via tablegen which processor resources
are load/store queue resources.
A new tablegen class named MemoryQueue can be optionally used to mark resources
that model load/store queues. Information about the load/store queue is
collected at 'CodeGenSchedule' stage, and analyzed by the 'SubtargetEmitter' to
initialize two new fields in struct MCExtraProcessorInfo named `LoadQueueID` and
`StoreQueueID`. Those two fields are identifiers for buffered resources used to
describe the load queue and the store queue.
Field `BufferSize` is interpreted as the number of entries in the queue, while
the number of units is a throughput indicator (i.e. number of available pickers
for loads/stores).
At construction time, LSUnit in llvm-mca checks for the presence of extra
processor information (i.e. MCExtraProcessorInfo) in the scheduling model. If
that information is available, and fields LoadQueueID and StoreQueueID are set
to a value different than zero (i.e. the invalid processor resource index), then
LSUnit initializes its LoadQueue/StoreQueue based on the BufferSize value
declared by the two processor resources.
With this patch, we more accurately track dynamic dispatch stalls caused by the
lack of LS tokens (i.e. load/store queue full). This is also shown by the
differences in two BdVer2 tests. Stalls that were previously classified as
generic SCHEDULER FULL stalls, are not correctly classified either as "load
queue full" or "store queue full".
About the differences in the -scheduler-stats view: those differences are
expected, because entries in the load/store queue are not released at
instruction issue stage. Instead, those are released at instruction executed
stage. This is the main reason why for the modified tests, the load/store
queues gets full before PdEx is full.
Differential Revision: https://reviews.llvm.org/D54957
llvm-svn: 347857
2018-11-29 13:15:56 +01:00
|
|
|
// Add information about load/store queues.
|
|
|
|
EmitLoadStoreQueueInfo(ProcModel, OS);
|
|
|
|
|
2018-04-04 13:53:13 +02:00
|
|
|
OS << "};\n";
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
}
|
|
|
|
|
2012-09-18 00:18:45 +02:00
|
|
|
void SubtargetEmitter::EmitProcessorResources(const CodeGenProcModel &ProcModel,
|
|
|
|
raw_ostream &OS) {
|
2018-02-08 09:46:48 +01:00
|
|
|
EmitProcessorResourceSubUnits(ProcModel, OS);
|
|
|
|
|
2018-09-18 17:38:56 +02:00
|
|
|
OS << "\n// {Name, NumUnits, SuperIdx, BufferSize, SubUnitsIdxBegin}\n";
|
2018-02-08 20:57:05 +01:00
|
|
|
OS << "static const llvm::MCProcResourceDesc " << ProcModel.ModelName
|
|
|
|
<< "ProcResources"
|
|
|
|
<< "[] = {\n"
|
2018-03-08 11:38:45 +01:00
|
|
|
<< " {\"InvalidUnit\", 0, 0, 0, 0},\n";
|
2012-09-18 00:18:45 +02:00
|
|
|
|
2018-02-08 09:46:48 +01:00
|
|
|
unsigned SubUnitsOffset = 1;
|
2012-09-18 00:18:45 +02:00
|
|
|
for (unsigned i = 0, e = ProcModel.ProcResourceDefs.size(); i < e; ++i) {
|
|
|
|
Record *PRDef = ProcModel.ProcResourceDefs[i];
|
|
|
|
|
2014-04-15 09:20:03 +02:00
|
|
|
Record *SuperDef = nullptr;
|
2013-03-14 22:21:50 +01:00
|
|
|
unsigned SuperIdx = 0;
|
|
|
|
unsigned NumUnits = 0;
|
2018-02-08 09:46:48 +01:00
|
|
|
const unsigned SubUnitsBeginOffset = SubUnitsOffset;
|
2013-06-15 06:50:06 +02:00
|
|
|
int BufferSize = PRDef->getValueAsInt("BufferSize");
|
2013-03-14 22:21:50 +01:00
|
|
|
if (PRDef->isSubClassOf("ProcResGroup")) {
|
|
|
|
RecVec ResUnits = PRDef->getValueAsListOfDefs("Resources");
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *RU : ResUnits) {
|
|
|
|
NumUnits += RU->getValueAsInt("NumUnits");
|
2018-02-09 11:28:46 +01:00
|
|
|
SubUnitsOffset += RU->getValueAsInt("NumUnits");
|
2013-03-14 22:21:50 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
// Find the SuperIdx
|
|
|
|
if (PRDef->getValueInit("Super")->isComplete()) {
|
2017-11-21 22:33:52 +01:00
|
|
|
SuperDef =
|
|
|
|
SchedModels.findProcResUnits(PRDef->getValueAsDef("Super"),
|
|
|
|
ProcModel, PRDef->getLoc());
|
2013-03-14 22:21:50 +01:00
|
|
|
SuperIdx = ProcModel.getProcResourceIdx(SuperDef);
|
|
|
|
}
|
2013-03-14 23:47:01 +01:00
|
|
|
NumUnits = PRDef->getValueAsInt("NumUnits");
|
2012-09-18 00:18:45 +02:00
|
|
|
}
|
|
|
|
// Emit the ProcResourceDesc
|
2018-03-08 11:38:45 +01:00
|
|
|
OS << " {\"" << PRDef->getName() << "\", ";
|
2012-09-18 00:18:45 +02:00
|
|
|
if (PRDef->getName().size() < 15)
|
|
|
|
OS.indent(15 - PRDef->getName().size());
|
2018-02-08 09:46:48 +01:00
|
|
|
OS << NumUnits << ", " << SuperIdx << ", " << BufferSize << ", ";
|
|
|
|
if (SubUnitsBeginOffset != SubUnitsOffset) {
|
|
|
|
OS << ProcModel.ModelName << "ProcResourceSubUnits + "
|
|
|
|
<< SubUnitsBeginOffset;
|
|
|
|
} else {
|
|
|
|
OS << "nullptr";
|
|
|
|
}
|
|
|
|
OS << "}, // #" << i+1;
|
2012-09-18 00:18:45 +02:00
|
|
|
if (SuperDef)
|
|
|
|
OS << ", Super=" << SuperDef->getName();
|
|
|
|
OS << "\n";
|
|
|
|
}
|
|
|
|
OS << "};\n";
|
|
|
|
}
|
|
|
|
|
2012-09-18 00:18:48 +02:00
|
|
|
// Find the WriteRes Record that defines processor resources for this
|
|
|
|
// SchedWrite.
|
|
|
|
Record *SubtargetEmitter::FindWriteResources(
|
2012-09-22 04:24:21 +02:00
|
|
|
const CodeGenSchedRW &SchedWrite, const CodeGenProcModel &ProcModel) {
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
// Check if the SchedWrite is already subtarget-specific and directly
|
|
|
|
// specifies a set of processor resources.
|
2012-09-22 04:24:21 +02:00
|
|
|
if (SchedWrite.TheDef->isSubClassOf("SchedWriteRes"))
|
|
|
|
return SchedWrite.TheDef;
|
|
|
|
|
2014-04-15 09:20:03 +02:00
|
|
|
Record *AliasDef = nullptr;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *A : SchedWrite.Aliases) {
|
2012-09-22 04:24:21 +02:00
|
|
|
const CodeGenSchedRW &AliasRW =
|
2016-02-13 07:03:32 +01:00
|
|
|
SchedModels.getSchedRW(A->getValueAsDef("AliasRW"));
|
2012-10-04 01:06:28 +02:00
|
|
|
if (AliasRW.TheDef->getValueInit("SchedModel")->isComplete()) {
|
|
|
|
Record *ModelDef = AliasRW.TheDef->getValueAsDef("SchedModel");
|
|
|
|
if (&SchedModels.getProcModel(ModelDef) != &ProcModel)
|
|
|
|
continue;
|
|
|
|
}
|
2012-09-22 04:24:21 +02:00
|
|
|
if (AliasDef)
|
2012-10-25 22:33:17 +02:00
|
|
|
PrintFatalError(AliasRW.TheDef->getLoc(), "Multiple aliases "
|
2012-09-22 04:24:21 +02:00
|
|
|
"defined for processor " + ProcModel.ModelName +
|
|
|
|
" Ensure only one SchedAlias exists per RW.");
|
|
|
|
AliasDef = AliasRW.TheDef;
|
|
|
|
}
|
|
|
|
if (AliasDef && AliasDef->isSubClassOf("SchedWriteRes"))
|
|
|
|
return AliasDef;
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
// Check this processor's list of write resources.
|
2014-04-15 09:20:03 +02:00
|
|
|
Record *ResDef = nullptr;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *WR : ProcModel.WriteResDefs) {
|
|
|
|
if (!WR->isSubClassOf("WriteRes"))
|
2012-09-18 00:18:48 +02:00
|
|
|
continue;
|
2016-02-13 07:03:32 +01:00
|
|
|
if (AliasDef == WR->getValueAsDef("WriteType")
|
|
|
|
|| SchedWrite.TheDef == WR->getValueAsDef("WriteType")) {
|
2012-09-22 04:24:21 +02:00
|
|
|
if (ResDef) {
|
2016-02-13 07:03:32 +01:00
|
|
|
PrintFatalError(WR->getLoc(), "Resources are defined for both "
|
2012-09-22 04:24:21 +02:00
|
|
|
"SchedWrite and its alias on processor " +
|
|
|
|
ProcModel.ModelName);
|
|
|
|
}
|
2016-02-13 07:03:32 +01:00
|
|
|
ResDef = WR;
|
2012-09-22 04:24:21 +02:00
|
|
|
}
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
2012-09-22 04:24:21 +02:00
|
|
|
// TODO: If ProcModel has a base model (previous generation processor),
|
|
|
|
// then call FindWriteResources recursively with that model here.
|
|
|
|
if (!ResDef) {
|
2012-10-25 22:33:17 +02:00
|
|
|
PrintFatalError(ProcModel.ModelDef->getLoc(),
|
2017-10-26 22:49:36 +02:00
|
|
|
Twine("Processor does not define resources for ") +
|
|
|
|
SchedWrite.TheDef->getName());
|
2012-09-22 04:24:21 +02:00
|
|
|
}
|
|
|
|
return ResDef;
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Find the ReadAdvance record for the given SchedRead on this processor or
|
|
|
|
/// return NULL.
|
2012-09-22 04:24:21 +02:00
|
|
|
Record *SubtargetEmitter::FindReadAdvance(const CodeGenSchedRW &SchedRead,
|
2012-09-18 00:18:48 +02:00
|
|
|
const CodeGenProcModel &ProcModel) {
|
|
|
|
// Check for SchedReads that directly specify a ReadAdvance.
|
2012-09-22 04:24:21 +02:00
|
|
|
if (SchedRead.TheDef->isSubClassOf("SchedReadAdvance"))
|
|
|
|
return SchedRead.TheDef;
|
|
|
|
|
|
|
|
// Check this processor's list of aliases for SchedRead.
|
2014-04-15 09:20:03 +02:00
|
|
|
Record *AliasDef = nullptr;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *A : SchedRead.Aliases) {
|
2012-09-22 04:24:21 +02:00
|
|
|
const CodeGenSchedRW &AliasRW =
|
2016-02-13 07:03:32 +01:00
|
|
|
SchedModels.getSchedRW(A->getValueAsDef("AliasRW"));
|
2012-10-04 01:06:28 +02:00
|
|
|
if (AliasRW.TheDef->getValueInit("SchedModel")->isComplete()) {
|
|
|
|
Record *ModelDef = AliasRW.TheDef->getValueAsDef("SchedModel");
|
|
|
|
if (&SchedModels.getProcModel(ModelDef) != &ProcModel)
|
|
|
|
continue;
|
|
|
|
}
|
2012-09-22 04:24:21 +02:00
|
|
|
if (AliasDef)
|
2012-10-25 22:33:17 +02:00
|
|
|
PrintFatalError(AliasRW.TheDef->getLoc(), "Multiple aliases "
|
2012-09-22 04:24:21 +02:00
|
|
|
"defined for processor " + ProcModel.ModelName +
|
|
|
|
" Ensure only one SchedAlias exists per RW.");
|
|
|
|
AliasDef = AliasRW.TheDef;
|
|
|
|
}
|
|
|
|
if (AliasDef && AliasDef->isSubClassOf("SchedReadAdvance"))
|
|
|
|
return AliasDef;
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
// Check this processor's ReadAdvanceList.
|
2014-04-15 09:20:03 +02:00
|
|
|
Record *ResDef = nullptr;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *RA : ProcModel.ReadAdvanceDefs) {
|
|
|
|
if (!RA->isSubClassOf("ReadAdvance"))
|
2012-09-18 00:18:48 +02:00
|
|
|
continue;
|
2016-02-13 07:03:32 +01:00
|
|
|
if (AliasDef == RA->getValueAsDef("ReadType")
|
|
|
|
|| SchedRead.TheDef == RA->getValueAsDef("ReadType")) {
|
2012-09-22 04:24:21 +02:00
|
|
|
if (ResDef) {
|
2016-02-13 07:03:32 +01:00
|
|
|
PrintFatalError(RA->getLoc(), "Resources are defined for both "
|
2012-09-22 04:24:21 +02:00
|
|
|
"SchedRead and its alias on processor " +
|
|
|
|
ProcModel.ModelName);
|
|
|
|
}
|
2016-02-13 07:03:32 +01:00
|
|
|
ResDef = RA;
|
2012-09-22 04:24:21 +02:00
|
|
|
}
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
2012-09-22 04:24:21 +02:00
|
|
|
// TODO: If ProcModel has a base model (previous generation processor),
|
|
|
|
// then call FindReadAdvance recursively with that model here.
|
|
|
|
if (!ResDef && SchedRead.TheDef->getName() != "ReadDefault") {
|
2012-10-25 22:33:17 +02:00
|
|
|
PrintFatalError(ProcModel.ModelDef->getLoc(),
|
2017-10-26 22:49:36 +02:00
|
|
|
Twine("Processor does not define resources for ") +
|
|
|
|
SchedRead.TheDef->getName());
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
2012-09-22 04:24:21 +02:00
|
|
|
return ResDef;
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
|
|
|
|
2013-03-14 22:21:50 +01:00
|
|
|
// Expand an explicit list of processor resources into a full list of implied
|
2013-04-24 01:45:16 +02:00
|
|
|
// resource groups and super resources that cover them.
|
2013-03-14 22:21:50 +01:00
|
|
|
void SubtargetEmitter::ExpandProcResources(RecVec &PRVec,
|
|
|
|
std::vector<int64_t> &Cycles,
|
2013-04-24 01:45:16 +02:00
|
|
|
const CodeGenProcModel &PM) {
|
2018-06-13 11:41:49 +02:00
|
|
|
assert(PRVec.size() == Cycles.size() && "failed precondition");
|
2013-03-14 22:21:50 +01:00
|
|
|
for (unsigned i = 0, e = PRVec.size(); i != e; ++i) {
|
2013-04-24 01:45:16 +02:00
|
|
|
Record *PRDef = PRVec[i];
|
2013-03-14 22:21:50 +01:00
|
|
|
RecVec SubResources;
|
2013-04-24 01:45:16 +02:00
|
|
|
if (PRDef->isSubClassOf("ProcResGroup"))
|
|
|
|
SubResources = PRDef->getValueAsListOfDefs("Resources");
|
2013-03-14 22:21:50 +01:00
|
|
|
else {
|
2013-04-24 01:45:16 +02:00
|
|
|
SubResources.push_back(PRDef);
|
2017-11-21 22:33:52 +01:00
|
|
|
PRDef = SchedModels.findProcResUnits(PRDef, PM, PRDef->getLoc());
|
2013-04-24 01:45:16 +02:00
|
|
|
for (Record *SubDef = PRDef;
|
|
|
|
SubDef->getValueInit("Super")->isComplete();) {
|
|
|
|
if (SubDef->isSubClassOf("ProcResGroup")) {
|
|
|
|
// Disallow this for simplicitly.
|
|
|
|
PrintFatalError(SubDef->getLoc(), "Processor resource group "
|
|
|
|
" cannot be a super resources.");
|
|
|
|
}
|
|
|
|
Record *SuperDef =
|
2017-11-21 22:33:52 +01:00
|
|
|
SchedModels.findProcResUnits(SubDef->getValueAsDef("Super"), PM,
|
|
|
|
SubDef->getLoc());
|
2013-04-24 01:45:16 +02:00
|
|
|
PRVec.push_back(SuperDef);
|
|
|
|
Cycles.push_back(Cycles[i]);
|
|
|
|
SubDef = SuperDef;
|
|
|
|
}
|
2013-03-14 22:21:50 +01:00
|
|
|
}
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *PR : PM.ProcResourceDefs) {
|
|
|
|
if (PR == PRDef || !PR->isSubClassOf("ProcResGroup"))
|
2013-03-14 22:21:50 +01:00
|
|
|
continue;
|
2016-02-13 07:03:32 +01:00
|
|
|
RecVec SuperResources = PR->getValueAsListOfDefs("Resources");
|
2013-03-14 22:21:50 +01:00
|
|
|
RecIter SubI = SubResources.begin(), SubE = SubResources.end();
|
2013-04-24 01:45:11 +02:00
|
|
|
for( ; SubI != SubE; ++SubI) {
|
2016-08-12 00:21:41 +02:00
|
|
|
if (!is_contained(SuperResources, *SubI)) {
|
2013-03-14 22:21:50 +01:00
|
|
|
break;
|
2013-04-24 01:45:11 +02:00
|
|
|
}
|
2013-03-14 22:21:50 +01:00
|
|
|
}
|
|
|
|
if (SubI == SubE) {
|
2016-02-13 07:03:32 +01:00
|
|
|
PRVec.push_back(PR);
|
2013-03-14 22:21:50 +01:00
|
|
|
Cycles.push_back(Cycles[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-18 00:18:48 +02:00
|
|
|
// Generate the SchedClass table for this processor and update global
|
|
|
|
// tables. Must be called for each processor in order.
|
|
|
|
void SubtargetEmitter::GenSchedClassTables(const CodeGenProcModel &ProcModel,
|
|
|
|
SchedClassTables &SchedTables) {
|
|
|
|
SchedTables.ProcSchedClasses.resize(SchedTables.ProcSchedClasses.size() + 1);
|
|
|
|
if (!ProcModel.hasInstrSchedModel())
|
|
|
|
return;
|
|
|
|
|
|
|
|
std::vector<MCSchedClassDesc> &SCTab = SchedTables.ProcSchedClasses.back();
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << "\n+++ SCHED CLASSES (GenSchedClassTables) +++\n");
|
2016-02-13 07:03:32 +01:00
|
|
|
for (const CodeGenSchedClass &SC : SchedModels.schedClasses()) {
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(SC.dump(&SchedModels));
|
2012-10-04 01:06:25 +02:00
|
|
|
|
2012-09-18 00:18:48 +02:00
|
|
|
SCTab.resize(SCTab.size() + 1);
|
|
|
|
MCSchedClassDesc &SCDesc = SCTab.back();
|
2012-09-18 05:18:56 +02:00
|
|
|
// SCDesc.Name is guarded by NDEBUG
|
2012-09-18 00:18:48 +02:00
|
|
|
SCDesc.NumMicroOps = 0;
|
|
|
|
SCDesc.BeginGroup = false;
|
|
|
|
SCDesc.EndGroup = false;
|
2020-12-29 17:49:09 +01:00
|
|
|
SCDesc.RetireOOO = false;
|
2012-09-18 00:18:48 +02:00
|
|
|
SCDesc.WriteProcResIdx = 0;
|
|
|
|
SCDesc.WriteLatencyIdx = 0;
|
|
|
|
SCDesc.ReadAdvanceIdx = 0;
|
|
|
|
|
|
|
|
// A Variant SchedClass has no resources of its own.
|
2013-03-26 22:36:39 +01:00
|
|
|
bool HasVariants = false;
|
2017-10-06 17:25:04 +02:00
|
|
|
for (const CodeGenSchedTransition &CGT :
|
|
|
|
make_range(SC.Transitions.begin(), SC.Transitions.end())) {
|
2020-12-07 09:53:33 +01:00
|
|
|
if (CGT.ProcIndex == ProcModel.Index) {
|
2013-03-26 22:36:39 +01:00
|
|
|
HasVariants = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (HasVariants) {
|
2012-09-18 00:18:48 +02:00
|
|
|
SCDesc.NumMicroOps = MCSchedClassDesc::VariantNumMicroOps;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Determine if the SchedClass is actually reachable on this processor. If
|
|
|
|
// not don't try to locate the processor resources, it will fail.
|
|
|
|
// If ProcIndices contains 0, this class applies to all processors.
|
2016-02-13 07:03:32 +01:00
|
|
|
assert(!SC.ProcIndices.empty() && "expect at least one procidx");
|
|
|
|
if (SC.ProcIndices[0] != 0) {
|
2016-08-12 05:55:06 +02:00
|
|
|
if (!is_contained(SC.ProcIndices, ProcModel.Index))
|
2012-09-18 00:18:48 +02:00
|
|
|
continue;
|
|
|
|
}
|
2016-02-13 07:03:32 +01:00
|
|
|
IdxVec Writes = SC.Writes;
|
|
|
|
IdxVec Reads = SC.Reads;
|
|
|
|
if (!SC.InstRWs.empty()) {
|
2018-03-17 18:30:08 +01:00
|
|
|
// This class has a default ReadWrite list which can be overridden by
|
2012-10-04 01:06:25 +02:00
|
|
|
// InstRW definitions.
|
2014-04-15 09:20:03 +02:00
|
|
|
Record *RWDef = nullptr;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *RW : SC.InstRWs) {
|
|
|
|
Record *RWModelDef = RW->getValueAsDef("SchedModel");
|
2012-09-18 00:18:48 +02:00
|
|
|
if (&ProcModel == &SchedModels.getProcModel(RWModelDef)) {
|
2016-02-13 07:03:32 +01:00
|
|
|
RWDef = RW;
|
2012-09-18 00:18:48 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (RWDef) {
|
2012-10-04 01:06:28 +02:00
|
|
|
Writes.clear();
|
|
|
|
Reads.clear();
|
2012-09-18 00:18:48 +02:00
|
|
|
SchedModels.findRWs(RWDef->getValueAsListOfDefs("OperandReadWrites"),
|
|
|
|
Writes, Reads);
|
|
|
|
}
|
|
|
|
}
|
2013-03-16 19:58:55 +01:00
|
|
|
if (Writes.empty()) {
|
|
|
|
// Check this processor's itinerary class resources.
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *I : ProcModel.ItinRWDefs) {
|
|
|
|
RecVec Matched = I->getValueAsListOfDefs("MatchedItinClasses");
|
2016-08-12 00:21:41 +02:00
|
|
|
if (is_contained(Matched, SC.ItinClassDef)) {
|
2016-02-13 07:03:32 +01:00
|
|
|
SchedModels.findRWs(I->getValueAsListOfDefs("OperandReadWrites"),
|
2013-03-16 19:58:55 +01:00
|
|
|
Writes, Reads);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (Writes.empty()) {
|
2018-05-14 14:53:11 +02:00
|
|
|
LLVM_DEBUG(dbgs() << ProcModel.ModelName
|
|
|
|
<< " does not have resources for class " << SC.Name
|
|
|
|
<< '\n');
|
[TableGen] Fix a bug that MCSchedClassDesc is interfered between different SchedModel
Assume that, ModelA has scheduling resource for InstA and ModelB has scheduling resource for InstB. This is what the llvm::MCSchedClassDesc looks like:
llvm::MCSchedClassDesc ModelASchedClasses[] = {
...
InstA, 0, ...
InstB, -1,...
};
llvm::MCSchedClassDesc ModelBSchedClasses[] = {
...
InstA, -1,...
InstB, 0,...
};
The -1 means invalid num of macro ops, while it is valid if it is >=0. This is what we look like now:
llvm::MCSchedClassDesc ModelASchedClasses[] = {
...
InstA, 0, ...
InstB, 0,...
};
llvm::MCSchedClassDesc ModelBSchedClasses[] = {
...
InstA, 0,...
InstB, 0,...
};
And compiler hit the assertion here because the SCDesc is valid now for both InstA and InstB.
Differential Revision: https://reviews.llvm.org/D67950
llvm-svn: 374524
2019-10-11 10:36:54 +02:00
|
|
|
SCDesc.NumMicroOps = MCSchedClassDesc::InvalidNumMicroOps;
|
2013-03-16 19:58:55 +01:00
|
|
|
}
|
|
|
|
}
|
2012-09-18 00:18:48 +02:00
|
|
|
// Sum resources across all operand writes.
|
|
|
|
std::vector<MCWriteProcResEntry> WriteProcResources;
|
|
|
|
std::vector<MCWriteLatencyEntry> WriteLatencies;
|
2012-09-19 06:43:19 +02:00
|
|
|
std::vector<std::string> WriterNames;
|
2012-09-18 00:18:48 +02:00
|
|
|
std::vector<MCReadAdvanceEntry> ReadAdvanceEntries;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (unsigned W : Writes) {
|
2012-09-18 00:18:48 +02:00
|
|
|
IdxVec WriteSeq;
|
2016-02-13 07:03:32 +01:00
|
|
|
SchedModels.expandRWSeqForProc(W, WriteSeq, /*IsRead=*/false,
|
2012-10-04 01:06:28 +02:00
|
|
|
ProcModel);
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
// For each operand, create a latency entry.
|
|
|
|
MCWriteLatencyEntry WLEntry;
|
|
|
|
WLEntry.Cycles = 0;
|
2012-09-19 06:43:19 +02:00
|
|
|
unsigned WriteID = WriteSeq.back();
|
|
|
|
WriterNames.push_back(SchedModels.getSchedWrite(WriteID).Name);
|
|
|
|
// If this Write is not referenced by a ReadAdvance, don't distinguish it
|
|
|
|
// from other WriteLatency entries.
|
2013-03-16 19:58:55 +01:00
|
|
|
if (!SchedModels.hasReadOfWrite(
|
|
|
|
SchedModels.getSchedWrite(WriteID).TheDef)) {
|
2012-09-19 06:43:19 +02:00
|
|
|
WriteID = 0;
|
|
|
|
}
|
|
|
|
WLEntry.WriteResourceID = WriteID;
|
2012-09-18 00:18:48 +02:00
|
|
|
|
2016-02-13 07:03:32 +01:00
|
|
|
for (unsigned WS : WriteSeq) {
|
2012-09-18 00:18:48 +02:00
|
|
|
|
2012-09-22 04:24:21 +02:00
|
|
|
Record *WriteRes =
|
2016-02-13 07:03:32 +01:00
|
|
|
FindWriteResources(SchedModels.getSchedWrite(WS), ProcModel);
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
// Mark the parent class as invalid for unsupported write types.
|
|
|
|
if (WriteRes->getValueAsBit("Unsupported")) {
|
|
|
|
SCDesc.NumMicroOps = MCSchedClassDesc::InvalidNumMicroOps;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
WLEntry.Cycles += WriteRes->getValueAsInt("Latency");
|
|
|
|
SCDesc.NumMicroOps += WriteRes->getValueAsInt("NumMicroOps");
|
|
|
|
SCDesc.BeginGroup |= WriteRes->getValueAsBit("BeginGroup");
|
|
|
|
SCDesc.EndGroup |= WriteRes->getValueAsBit("EndGroup");
|
2017-03-27 22:46:37 +02:00
|
|
|
SCDesc.BeginGroup |= WriteRes->getValueAsBit("SingleIssue");
|
|
|
|
SCDesc.EndGroup |= WriteRes->getValueAsBit("SingleIssue");
|
2020-12-29 17:49:09 +01:00
|
|
|
SCDesc.RetireOOO |= WriteRes->getValueAsBit("RetireOOO");
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
// Create an entry for each ProcResource listed in WriteRes.
|
|
|
|
RecVec PRVec = WriteRes->getValueAsListOfDefs("ProcResources");
|
|
|
|
std::vector<int64_t> Cycles =
|
|
|
|
WriteRes->getValueAsListOfInts("ResourceCycles");
|
2013-03-14 22:21:50 +01:00
|
|
|
|
2018-06-13 11:41:49 +02:00
|
|
|
if (Cycles.empty()) {
|
|
|
|
// If ResourceCycles is not provided, default to one cycle per
|
|
|
|
// resource.
|
|
|
|
Cycles.resize(PRVec.size(), 1);
|
|
|
|
} else if (Cycles.size() != PRVec.size()) {
|
|
|
|
// If ResourceCycles is provided, check consistency.
|
|
|
|
PrintFatalError(
|
|
|
|
WriteRes->getLoc(),
|
|
|
|
Twine("Inconsistent resource cycles: !size(ResourceCycles) != "
|
|
|
|
"!size(ProcResources): ")
|
|
|
|
.concat(Twine(PRVec.size()))
|
|
|
|
.concat(" vs ")
|
|
|
|
.concat(Twine(Cycles.size())));
|
|
|
|
}
|
|
|
|
|
2013-03-14 22:21:50 +01:00
|
|
|
ExpandProcResources(PRVec, Cycles, ProcModel);
|
|
|
|
|
2012-09-18 00:18:48 +02:00
|
|
|
for (unsigned PRIdx = 0, PREnd = PRVec.size();
|
|
|
|
PRIdx != PREnd; ++PRIdx) {
|
|
|
|
MCWriteProcResEntry WPREntry;
|
|
|
|
WPREntry.ProcResourceIdx = ProcModel.getProcResourceIdx(PRVec[PRIdx]);
|
|
|
|
assert(WPREntry.ProcResourceIdx && "Bad ProcResourceIdx");
|
2013-03-14 22:21:50 +01:00
|
|
|
WPREntry.Cycles = Cycles[PRIdx];
|
2013-03-02 00:31:26 +01:00
|
|
|
// If this resource is already used in this sequence, add the current
|
|
|
|
// entry's cycles so that the same resource appears to be used
|
|
|
|
// serially, rather than multiple parallel uses. This is important for
|
|
|
|
// in-order machine where the resource consumption is a hazard.
|
|
|
|
unsigned WPRIdx = 0, WPREnd = WriteProcResources.size();
|
|
|
|
for( ; WPRIdx != WPREnd; ++WPRIdx) {
|
|
|
|
if (WriteProcResources[WPRIdx].ProcResourceIdx
|
|
|
|
== WPREntry.ProcResourceIdx) {
|
|
|
|
WriteProcResources[WPRIdx].Cycles += WPREntry.Cycles;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (WPRIdx == WPREnd)
|
|
|
|
WriteProcResources.push_back(WPREntry);
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
WriteLatencies.push_back(WLEntry);
|
|
|
|
}
|
|
|
|
// Create an entry for each operand Read in this SchedClass.
|
|
|
|
// Entries must be sorted first by UseIdx then by WriteResourceID.
|
|
|
|
for (unsigned UseIdx = 0, EndIdx = Reads.size();
|
|
|
|
UseIdx != EndIdx; ++UseIdx) {
|
2012-09-22 04:24:21 +02:00
|
|
|
Record *ReadAdvance =
|
|
|
|
FindReadAdvance(SchedModels.getSchedRead(Reads[UseIdx]), ProcModel);
|
2012-09-18 00:18:48 +02:00
|
|
|
if (!ReadAdvance)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Mark the parent class as invalid for unsupported write types.
|
|
|
|
if (ReadAdvance->getValueAsBit("Unsupported")) {
|
|
|
|
SCDesc.NumMicroOps = MCSchedClassDesc::InvalidNumMicroOps;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
RecVec ValidWrites = ReadAdvance->getValueAsListOfDefs("ValidWrites");
|
|
|
|
IdxVec WriteIDs;
|
|
|
|
if (ValidWrites.empty())
|
|
|
|
WriteIDs.push_back(0);
|
|
|
|
else {
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *VW : ValidWrites) {
|
|
|
|
WriteIDs.push_back(SchedModels.getSchedRWIdx(VW, /*IsRead=*/false));
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
|
|
|
}
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(WriteIDs);
|
2016-02-13 07:03:32 +01:00
|
|
|
for(unsigned W : WriteIDs) {
|
2012-09-18 00:18:48 +02:00
|
|
|
MCReadAdvanceEntry RAEntry;
|
|
|
|
RAEntry.UseIdx = UseIdx;
|
2016-02-13 07:03:32 +01:00
|
|
|
RAEntry.WriteResourceID = W;
|
2012-09-18 00:18:48 +02:00
|
|
|
RAEntry.Cycles = ReadAdvance->getValueAsInt("Cycles");
|
|
|
|
ReadAdvanceEntries.push_back(RAEntry);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (SCDesc.NumMicroOps == MCSchedClassDesc::InvalidNumMicroOps) {
|
|
|
|
WriteProcResources.clear();
|
|
|
|
WriteLatencies.clear();
|
|
|
|
ReadAdvanceEntries.clear();
|
|
|
|
}
|
|
|
|
// Add the information for this SchedClass to the global tables using basic
|
|
|
|
// compression.
|
|
|
|
//
|
|
|
|
// WritePrecRes entries are sorted by ProcResIdx.
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(WriteProcResources, LessWriteProcResources());
|
2012-09-18 00:18:48 +02:00
|
|
|
|
|
|
|
SCDesc.NumWriteProcResEntries = WriteProcResources.size();
|
|
|
|
std::vector<MCWriteProcResEntry>::iterator WPRPos =
|
|
|
|
std::search(SchedTables.WriteProcResources.begin(),
|
|
|
|
SchedTables.WriteProcResources.end(),
|
|
|
|
WriteProcResources.begin(), WriteProcResources.end());
|
|
|
|
if (WPRPos != SchedTables.WriteProcResources.end())
|
|
|
|
SCDesc.WriteProcResIdx = WPRPos - SchedTables.WriteProcResources.begin();
|
|
|
|
else {
|
|
|
|
SCDesc.WriteProcResIdx = SchedTables.WriteProcResources.size();
|
|
|
|
SchedTables.WriteProcResources.insert(WPRPos, WriteProcResources.begin(),
|
|
|
|
WriteProcResources.end());
|
|
|
|
}
|
|
|
|
// Latency entries must remain in operand order.
|
|
|
|
SCDesc.NumWriteLatencyEntries = WriteLatencies.size();
|
|
|
|
std::vector<MCWriteLatencyEntry>::iterator WLPos =
|
|
|
|
std::search(SchedTables.WriteLatencies.begin(),
|
|
|
|
SchedTables.WriteLatencies.end(),
|
|
|
|
WriteLatencies.begin(), WriteLatencies.end());
|
2012-09-19 06:43:19 +02:00
|
|
|
if (WLPos != SchedTables.WriteLatencies.end()) {
|
|
|
|
unsigned idx = WLPos - SchedTables.WriteLatencies.begin();
|
|
|
|
SCDesc.WriteLatencyIdx = idx;
|
|
|
|
for (unsigned i = 0, e = WriteLatencies.size(); i < e; ++i)
|
|
|
|
if (SchedTables.WriterNames[idx + i].find(WriterNames[i]) ==
|
|
|
|
std::string::npos) {
|
|
|
|
SchedTables.WriterNames[idx + i] += std::string("_") + WriterNames[i];
|
|
|
|
}
|
|
|
|
}
|
2012-09-18 00:18:48 +02:00
|
|
|
else {
|
|
|
|
SCDesc.WriteLatencyIdx = SchedTables.WriteLatencies.size();
|
2021-01-02 18:24:13 +01:00
|
|
|
llvm::append_range(SchedTables.WriteLatencies, WriteLatencies);
|
|
|
|
llvm::append_range(SchedTables.WriterNames, WriterNames);
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
|
|
|
// ReadAdvanceEntries must remain in operand order.
|
|
|
|
SCDesc.NumReadAdvanceEntries = ReadAdvanceEntries.size();
|
|
|
|
std::vector<MCReadAdvanceEntry>::iterator RAPos =
|
|
|
|
std::search(SchedTables.ReadAdvanceEntries.begin(),
|
|
|
|
SchedTables.ReadAdvanceEntries.end(),
|
|
|
|
ReadAdvanceEntries.begin(), ReadAdvanceEntries.end());
|
|
|
|
if (RAPos != SchedTables.ReadAdvanceEntries.end())
|
|
|
|
SCDesc.ReadAdvanceIdx = RAPos - SchedTables.ReadAdvanceEntries.begin();
|
|
|
|
else {
|
|
|
|
SCDesc.ReadAdvanceIdx = SchedTables.ReadAdvanceEntries.size();
|
2021-01-02 18:24:13 +01:00
|
|
|
llvm::append_range(SchedTables.ReadAdvanceEntries, ReadAdvanceEntries);
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-18 00:18:50 +02:00
|
|
|
// Emit SchedClass tables for all processors and associated global tables.
|
|
|
|
void SubtargetEmitter::EmitSchedClassTables(SchedClassTables &SchedTables,
|
|
|
|
raw_ostream &OS) {
|
|
|
|
// Emit global WriteProcResTable.
|
|
|
|
OS << "\n// {ProcResourceIdx, Cycles}\n"
|
|
|
|
<< "extern const llvm::MCWriteProcResEntry "
|
|
|
|
<< Target << "WriteProcResTable[] = {\n"
|
|
|
|
<< " { 0, 0}, // Invalid\n";
|
|
|
|
for (unsigned WPRIdx = 1, WPREnd = SchedTables.WriteProcResources.size();
|
|
|
|
WPRIdx != WPREnd; ++WPRIdx) {
|
|
|
|
MCWriteProcResEntry &WPREntry = SchedTables.WriteProcResources[WPRIdx];
|
|
|
|
OS << " {" << format("%2d", WPREntry.ProcResourceIdx) << ", "
|
|
|
|
<< format("%2d", WPREntry.Cycles) << "}";
|
|
|
|
if (WPRIdx + 1 < WPREnd)
|
|
|
|
OS << ',';
|
|
|
|
OS << " // #" << WPRIdx << '\n';
|
|
|
|
}
|
|
|
|
OS << "}; // " << Target << "WriteProcResTable\n";
|
|
|
|
|
|
|
|
// Emit global WriteLatencyTable.
|
|
|
|
OS << "\n// {Cycles, WriteResourceID}\n"
|
|
|
|
<< "extern const llvm::MCWriteLatencyEntry "
|
|
|
|
<< Target << "WriteLatencyTable[] = {\n"
|
|
|
|
<< " { 0, 0}, // Invalid\n";
|
|
|
|
for (unsigned WLIdx = 1, WLEnd = SchedTables.WriteLatencies.size();
|
|
|
|
WLIdx != WLEnd; ++WLIdx) {
|
|
|
|
MCWriteLatencyEntry &WLEntry = SchedTables.WriteLatencies[WLIdx];
|
|
|
|
OS << " {" << format("%2d", WLEntry.Cycles) << ", "
|
|
|
|
<< format("%2d", WLEntry.WriteResourceID) << "}";
|
|
|
|
if (WLIdx + 1 < WLEnd)
|
|
|
|
OS << ',';
|
2012-09-19 06:43:19 +02:00
|
|
|
OS << " // #" << WLIdx << " " << SchedTables.WriterNames[WLIdx] << '\n';
|
2012-09-18 00:18:50 +02:00
|
|
|
}
|
|
|
|
OS << "}; // " << Target << "WriteLatencyTable\n";
|
|
|
|
|
|
|
|
// Emit global ReadAdvanceTable.
|
|
|
|
OS << "\n// {UseIdx, WriteResourceID, Cycles}\n"
|
|
|
|
<< "extern const llvm::MCReadAdvanceEntry "
|
|
|
|
<< Target << "ReadAdvanceTable[] = {\n"
|
|
|
|
<< " {0, 0, 0}, // Invalid\n";
|
|
|
|
for (unsigned RAIdx = 1, RAEnd = SchedTables.ReadAdvanceEntries.size();
|
|
|
|
RAIdx != RAEnd; ++RAIdx) {
|
|
|
|
MCReadAdvanceEntry &RAEntry = SchedTables.ReadAdvanceEntries[RAIdx];
|
|
|
|
OS << " {" << RAEntry.UseIdx << ", "
|
|
|
|
<< format("%2d", RAEntry.WriteResourceID) << ", "
|
|
|
|
<< format("%2d", RAEntry.Cycles) << "}";
|
|
|
|
if (RAIdx + 1 < RAEnd)
|
|
|
|
OS << ',';
|
|
|
|
OS << " // #" << RAIdx << '\n';
|
|
|
|
}
|
|
|
|
OS << "}; // " << Target << "ReadAdvanceTable\n";
|
|
|
|
|
|
|
|
// Emit a SchedClass table for each processor.
|
|
|
|
for (CodeGenSchedModels::ProcIter PI = SchedModels.procModelBegin(),
|
|
|
|
PE = SchedModels.procModelEnd(); PI != PE; ++PI) {
|
|
|
|
if (!PI->hasInstrSchedModel())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
std::vector<MCSchedClassDesc> &SCTab =
|
2012-11-02 21:57:36 +01:00
|
|
|
SchedTables.ProcSchedClasses[1 + (PI - SchedModels.procModelBegin())];
|
2012-09-18 00:18:50 +02:00
|
|
|
|
2020-12-29 17:49:09 +01:00
|
|
|
OS << "\n// {Name, NumMicroOps, BeginGroup, EndGroup, RetireOOO,"
|
2012-09-18 00:18:50 +02:00
|
|
|
<< " WriteProcResIdx,#, WriteLatencyIdx,#, ReadAdvanceIdx,#}\n";
|
|
|
|
OS << "static const llvm::MCSchedClassDesc "
|
|
|
|
<< PI->ModelName << "SchedClasses[] = {\n";
|
|
|
|
|
|
|
|
// The first class is always invalid. We no way to distinguish it except by
|
|
|
|
// name and position.
|
2013-03-16 19:58:55 +01:00
|
|
|
assert(SchedModels.getSchedClass(0).Name == "NoInstrModel"
|
2012-09-18 00:18:50 +02:00
|
|
|
&& "invalid class not first");
|
|
|
|
OS << " {DBGFIELD(\"InvalidSchedClass\") "
|
|
|
|
<< MCSchedClassDesc::InvalidNumMicroOps
|
2020-12-29 17:49:09 +01:00
|
|
|
<< ", false, false, false, 0, 0, 0, 0, 0, 0},\n";
|
2012-09-18 00:18:50 +02:00
|
|
|
|
|
|
|
for (unsigned SCIdx = 1, SCEnd = SCTab.size(); SCIdx != SCEnd; ++SCIdx) {
|
|
|
|
MCSchedClassDesc &MCDesc = SCTab[SCIdx];
|
|
|
|
const CodeGenSchedClass &SchedClass = SchedModels.getSchedClass(SCIdx);
|
|
|
|
OS << " {DBGFIELD(\"" << SchedClass.Name << "\") ";
|
|
|
|
if (SchedClass.Name.size() < 18)
|
|
|
|
OS.indent(18 - SchedClass.Name.size());
|
|
|
|
OS << MCDesc.NumMicroOps
|
2016-05-17 19:04:23 +02:00
|
|
|
<< ", " << ( MCDesc.BeginGroup ? "true" : "false" )
|
|
|
|
<< ", " << ( MCDesc.EndGroup ? "true" : "false" )
|
2020-12-29 17:49:09 +01:00
|
|
|
<< ", " << ( MCDesc.RetireOOO ? "true" : "false" )
|
2012-09-18 00:18:50 +02:00
|
|
|
<< ", " << format("%2d", MCDesc.WriteProcResIdx)
|
|
|
|
<< ", " << MCDesc.NumWriteProcResEntries
|
|
|
|
<< ", " << format("%2d", MCDesc.WriteLatencyIdx)
|
|
|
|
<< ", " << MCDesc.NumWriteLatencyEntries
|
|
|
|
<< ", " << format("%2d", MCDesc.ReadAdvanceIdx)
|
2017-10-24 17:50:53 +02:00
|
|
|
<< ", " << MCDesc.NumReadAdvanceEntries
|
|
|
|
<< "}, // #" << SCIdx << '\n';
|
2012-09-18 00:18:50 +02:00
|
|
|
}
|
|
|
|
OS << "}; // " << PI->ModelName << "SchedClasses\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
void SubtargetEmitter::EmitProcessorModels(raw_ostream &OS) {
|
|
|
|
// For each processor model.
|
2016-02-13 07:03:32 +01:00
|
|
|
for (const CodeGenProcModel &PM : SchedModels.procModels()) {
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
// Emit extra processor info if available.
|
|
|
|
if (PM.hasExtraProcessorInfo())
|
|
|
|
EmitExtraProcessorInfo(PM, OS);
|
2012-09-18 00:18:45 +02:00
|
|
|
// Emit processor resource table.
|
2016-02-13 07:03:32 +01:00
|
|
|
if (PM.hasInstrSchedModel())
|
|
|
|
EmitProcessorResources(PM, OS);
|
|
|
|
else if(!PM.ProcResourceDefs.empty())
|
|
|
|
PrintFatalError(PM.ModelDef->getLoc(), "SchedMachineModel defines "
|
2012-09-18 00:18:48 +02:00
|
|
|
"ProcResources without defining WriteRes SchedWriteRes");
|
2012-09-18 00:18:45 +02:00
|
|
|
|
2012-07-07 06:00:00 +02:00
|
|
|
// Begin processor itinerary properties
|
|
|
|
OS << "\n";
|
2016-02-13 07:03:32 +01:00
|
|
|
OS << "static const llvm::MCSchedModel " << PM.ModelName << " = {\n";
|
|
|
|
EmitProcessorProp(OS, PM.ModelDef, "IssueWidth", ',');
|
|
|
|
EmitProcessorProp(OS, PM.ModelDef, "MicroOpBufferSize", ',');
|
|
|
|
EmitProcessorProp(OS, PM.ModelDef, "LoopMicroOpBufferSize", ',');
|
|
|
|
EmitProcessorProp(OS, PM.ModelDef, "LoadLatency", ',');
|
|
|
|
EmitProcessorProp(OS, PM.ModelDef, "HighLatency", ',');
|
|
|
|
EmitProcessorProp(OS, PM.ModelDef, "MispredictPenalty", ',');
|
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
bool PostRAScheduler =
|
|
|
|
(PM.ModelDef ? PM.ModelDef->getValueAsBit("PostRAScheduler") : false);
|
2014-07-16 00:39:58 +02:00
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << " " << (PostRAScheduler ? "true" : "false") << ", // "
|
|
|
|
<< "PostRAScheduler\n";
|
|
|
|
|
|
|
|
bool CompleteModel =
|
|
|
|
(PM.ModelDef ? PM.ModelDef->getValueAsBit("CompleteModel") : false);
|
|
|
|
|
|
|
|
OS << " " << (CompleteModel ? "true" : "false") << ", // "
|
|
|
|
<< "CompleteModel\n";
|
2013-09-25 20:14:12 +02:00
|
|
|
|
2016-02-13 07:03:32 +01:00
|
|
|
OS << " " << PM.Index << ", // Processor ID\n";
|
|
|
|
if (PM.hasInstrSchedModel())
|
|
|
|
OS << " " << PM.ModelName << "ProcResources" << ",\n"
|
|
|
|
<< " " << PM.ModelName << "SchedClasses" << ",\n"
|
|
|
|
<< " " << PM.ProcResourceDefs.size()+1 << ",\n"
|
2012-09-18 05:18:56 +02:00
|
|
|
<< " " << (SchedModels.schedClassEnd()
|
|
|
|
- SchedModels.schedClassBegin()) << ",\n";
|
|
|
|
else
|
2015-10-07 01:24:35 +02:00
|
|
|
OS << " nullptr, nullptr, 0, 0,"
|
|
|
|
<< " // No instruction-level machine model.\n";
|
2016-02-13 07:03:32 +01:00
|
|
|
if (PM.hasItineraries())
|
[MC][Tablegen] Allow the definition of processor register files in the scheduling model for llvm-mca
This patch allows the description of register files in processor scheduling
models. This addresses PR36662.
A new tablegen class named 'RegisterFile' has been added to TargetSchedule.td.
Targets can optionally describe register files for their processors using that
class. In particular, class RegisterFile allows to specify:
- The total number of physical registers.
- Which target registers are accessible through the register file.
- The cost of allocating a register at register renaming stage.
Example (from this patch - see file X86/X86ScheduleBtVer2.td)
def FpuPRF : RegisterFile<72, [VR64, VR128, VR256], [1, 1, 2]>
Here, FpuPRF describes a register file for MMX/XMM/YMM registers. On Jaguar
(btver2), a YMM register definition consumes 2 physical registers, while MMX/XMM
register definitions only cost 1 physical register.
The syntax allows to specify an empty set of register classes. An empty set of
register classes means: this register file models all the registers specified by
the Target. For each register class, users can specify an optional register
cost. By default, register costs default to 1. A value of 0 for the number of
physical registers means: "this register file has an unbounded number of
physical registers".
This patch is structured in two parts.
* Part 1 - MC/Tablegen *
A first part adds the tablegen definition of RegisterFile, and teaches the
SubtargetEmitter how to emit information related to register files.
Information about register files is accessible through an instance of
MCExtraProcessorInfo.
The idea behind this design is to logically partition the processor description
which is only used by external tools (like llvm-mca) from the processor
information used by the llvm machine schedulers.
I think that this design would make easier for targets to get rid of the extra
processor information if they don't want it.
* Part 2 - llvm-mca related *
The second part of this patch is related to changes to llvm-mca.
The main differences are:
1) class RegisterFile now needs to take into account the "cost of a register"
when allocating physical registers at register renaming stage.
2) Point 1. triggered a minor refactoring which lef to the removal of the
"maximum 32 register files" restriction.
3) The BackendStatistics view has been updated so that we can print out extra
details related to each register file implemented by the processor.
The effect of point 3. is also visible in tests register-files-[1..5].s.
Differential Revision: https://reviews.llvm.org/D44980
llvm-svn: 329067
2018-04-03 15:36:24 +02:00
|
|
|
OS << " " << PM.ItinsDef->getName() << ",\n";
|
|
|
|
else
|
|
|
|
OS << " nullptr, // No Itinerary\n";
|
|
|
|
if (PM.hasExtraProcessorInfo())
|
2018-04-10 10:16:37 +02:00
|
|
|
OS << " &" << PM.ModelName << "ExtraInfo,\n";
|
2012-07-07 06:00:00 +02:00
|
|
|
else
|
2018-04-10 10:16:37 +02:00
|
|
|
OS << " nullptr // No extra processor descriptor\n";
|
2017-10-24 17:50:55 +02:00
|
|
|
OS << "};\n";
|
2012-07-07 06:00:00 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-10-27 21:47:21 +02:00
|
|
|
//
|
2012-07-07 06:00:00 +02:00
|
|
|
// EmitSchedModel - Emits all scheduling model tables, folding common patterns.
|
2005-10-27 21:47:21 +02:00
|
|
|
//
|
2012-07-07 06:00:00 +02:00
|
|
|
void SubtargetEmitter::EmitSchedModel(raw_ostream &OS) {
|
2012-09-18 00:18:45 +02:00
|
|
|
OS << "#ifdef DBGFIELD\n"
|
|
|
|
<< "#error \"<target>GenSubtargetInfo.inc requires a DBGFIELD macro\"\n"
|
|
|
|
<< "#endif\n"
|
2017-10-15 16:32:27 +02:00
|
|
|
<< "#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)\n"
|
2012-09-18 00:18:45 +02:00
|
|
|
<< "#define DBGFIELD(x) x,\n"
|
|
|
|
<< "#else\n"
|
|
|
|
<< "#define DBGFIELD(x)\n"
|
|
|
|
<< "#endif\n";
|
|
|
|
|
2013-03-16 19:58:55 +01:00
|
|
|
if (SchedModels.hasItineraries()) {
|
2016-12-09 23:06:55 +01:00
|
|
|
std::vector<std::vector<InstrItinerary>> ProcItinLists;
|
2005-11-01 21:06:59 +01:00
|
|
|
// Emit the stage data
|
2012-07-07 06:00:00 +02:00
|
|
|
EmitStageAndOperandCycleData(OS, ProcItinLists);
|
|
|
|
EmitItineraries(OS, ProcItinLists);
|
2005-11-01 21:06:59 +01:00
|
|
|
}
|
2012-09-18 00:18:50 +02:00
|
|
|
OS << "\n// ===============================================================\n"
|
|
|
|
<< "// Data tables for the new per-operand machine model.\n";
|
2012-09-18 00:18:45 +02:00
|
|
|
|
2012-09-18 00:18:48 +02:00
|
|
|
SchedClassTables SchedTables;
|
2016-02-13 07:03:32 +01:00
|
|
|
for (const CodeGenProcModel &ProcModel : SchedModels.procModels()) {
|
|
|
|
GenSchedClassTables(ProcModel, SchedTables);
|
2012-09-18 00:18:48 +02:00
|
|
|
}
|
2012-09-18 00:18:50 +02:00
|
|
|
EmitSchedClassTables(SchedTables, OS);
|
|
|
|
|
2019-03-05 19:54:38 +01:00
|
|
|
OS << "\n#undef DBGFIELD\n";
|
|
|
|
|
2012-09-18 00:18:50 +02:00
|
|
|
// Emit the processor machine model
|
|
|
|
EmitProcessorModels(OS);
|
2005-10-27 21:47:21 +02:00
|
|
|
}
|
|
|
|
|
2018-04-26 20:03:24 +02:00
|
|
|
static void emitPredicateProlog(const RecordKeeper &Records, raw_ostream &OS) {
|
|
|
|
std::string Buffer;
|
|
|
|
raw_string_ostream Stream(Buffer);
|
|
|
|
|
|
|
|
// Collect all the PredicateProlog records and print them to the output
|
|
|
|
// stream.
|
|
|
|
std::vector<Record *> Prologs =
|
|
|
|
Records.getAllDerivedDefinitions("PredicateProlog");
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(Prologs, LessRecord());
|
2018-04-26 20:03:24 +02:00
|
|
|
for (Record *P : Prologs)
|
|
|
|
Stream << P->getValueAsString("Code") << '\n';
|
|
|
|
|
|
|
|
Stream.flush();
|
|
|
|
OS << Buffer;
|
|
|
|
}
|
|
|
|
|
2020-11-24 09:43:51 +01:00
|
|
|
static bool isTruePredicate(const Record *Rec) {
|
|
|
|
return Rec->isSubClassOf("MCSchedPredicate") &&
|
|
|
|
Rec->getValueAsDef("Pred")->isSubClassOf("MCTrue");
|
|
|
|
}
|
|
|
|
|
2018-04-26 20:03:24 +02:00
|
|
|
static void emitPredicates(const CodeGenSchedTransition &T,
|
2018-08-13 13:09:04 +02:00
|
|
|
const CodeGenSchedClass &SC, PredicateExpander &PE,
|
2018-04-26 20:03:24 +02:00
|
|
|
raw_ostream &OS) {
|
|
|
|
std::string Buffer;
|
2018-08-13 17:13:35 +02:00
|
|
|
raw_string_ostream SS(Buffer);
|
2018-08-13 13:09:04 +02:00
|
|
|
|
|
|
|
// If not all predicates are MCTrue, then we need an if-stmt.
|
|
|
|
unsigned NumNonTruePreds =
|
2020-11-24 09:43:51 +01:00
|
|
|
T.PredTerm.size() - count_if(T.PredTerm, isTruePredicate);
|
2018-08-13 17:13:35 +02:00
|
|
|
|
|
|
|
SS.indent(PE.getIndentLevel() * 2);
|
|
|
|
|
2018-08-13 13:09:04 +02:00
|
|
|
if (NumNonTruePreds) {
|
|
|
|
bool FirstNonTruePredicate = true;
|
2018-08-13 17:13:35 +02:00
|
|
|
SS << "if (";
|
|
|
|
|
|
|
|
PE.setIndentLevel(PE.getIndentLevel() + 2);
|
|
|
|
|
2018-08-13 13:09:04 +02:00
|
|
|
for (const Record *Rec : T.PredTerm) {
|
|
|
|
// Skip predicates that evaluate to "true".
|
2020-11-24 09:43:51 +01:00
|
|
|
if (isTruePredicate(Rec))
|
2018-08-13 13:09:04 +02:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (FirstNonTruePredicate) {
|
|
|
|
FirstNonTruePredicate = false;
|
|
|
|
} else {
|
2018-08-13 17:13:35 +02:00
|
|
|
SS << "\n";
|
|
|
|
SS.indent(PE.getIndentLevel() * 2);
|
|
|
|
SS << "&& ";
|
2018-08-13 13:09:04 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if (Rec->isSubClassOf("MCSchedPredicate")) {
|
2018-08-13 17:13:35 +02:00
|
|
|
PE.expandPredicate(SS, Rec->getValueAsDef("Pred"));
|
2018-08-13 13:09:04 +02:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Expand this legacy predicate and wrap it around braces if there is more
|
|
|
|
// than one predicate to expand.
|
2018-08-13 17:13:35 +02:00
|
|
|
SS << ((NumNonTruePreds > 1) ? "(" : "")
|
|
|
|
<< Rec->getValueAsString("Predicate")
|
|
|
|
<< ((NumNonTruePreds > 1) ? ")" : "");
|
2018-05-25 17:55:37 +02:00
|
|
|
}
|
2018-08-13 13:09:04 +02:00
|
|
|
|
2018-08-13 17:13:35 +02:00
|
|
|
SS << ")\n"; // end of if-stmt
|
|
|
|
PE.decreaseIndentLevel();
|
|
|
|
SS.indent(PE.getIndentLevel() * 2);
|
|
|
|
PE.decreaseIndentLevel();
|
2018-04-26 20:03:24 +02:00
|
|
|
}
|
|
|
|
|
2018-08-13 17:13:35 +02:00
|
|
|
SS << "return " << T.ToClassIdx << "; // " << SC.Name << '\n';
|
|
|
|
SS.flush();
|
2018-04-26 20:03:24 +02:00
|
|
|
OS << Buffer;
|
|
|
|
}
|
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
// Used by method `SubtargetEmitter::emitSchedModelHelpersImpl()` to generate
|
|
|
|
// epilogue code for the auto-generated helper.
|
2020-09-27 00:57:09 +02:00
|
|
|
static void emitSchedModelHelperEpilogue(raw_ostream &OS,
|
|
|
|
bool ShouldReturnZero) {
|
2018-08-10 12:43:43 +02:00
|
|
|
if (ShouldReturnZero) {
|
|
|
|
OS << " // Don't know how to resolve this scheduling class.\n"
|
|
|
|
<< " return 0;\n";
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
OS << " report_fatal_error(\"Expected a variant SchedClass\");\n";
|
|
|
|
}
|
|
|
|
|
2020-09-27 00:57:09 +02:00
|
|
|
static bool hasMCSchedPredicates(const CodeGenSchedTransition &T) {
|
2018-08-10 12:43:43 +02:00
|
|
|
return all_of(T.PredTerm, [](const Record *Rec) {
|
|
|
|
return Rec->isSubClassOf("MCSchedPredicate");
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
2020-09-27 00:57:09 +02:00
|
|
|
static void collectVariantClasses(const CodeGenSchedModels &SchedModels,
|
|
|
|
IdxVec &VariantClasses,
|
|
|
|
bool OnlyExpandMCInstPredicates) {
|
2016-02-13 07:03:32 +01:00
|
|
|
for (const CodeGenSchedClass &SC : SchedModels.schedClasses()) {
|
2018-08-10 12:43:43 +02:00
|
|
|
// Ignore non-variant scheduling classes.
|
2016-02-13 07:03:32 +01:00
|
|
|
if (SC.Transitions.empty())
|
2012-09-18 05:41:43 +02:00
|
|
|
continue;
|
2018-08-10 12:43:43 +02:00
|
|
|
|
|
|
|
if (OnlyExpandMCInstPredicates) {
|
2018-11-23 22:17:33 +01:00
|
|
|
// Ignore this variant scheduling class no transitions use any meaningful
|
2018-08-10 12:43:43 +02:00
|
|
|
// MCSchedPredicate definitions.
|
2018-11-23 22:17:33 +01:00
|
|
|
if (!any_of(SC.Transitions, [](const CodeGenSchedTransition &T) {
|
2018-08-10 12:43:43 +02:00
|
|
|
return hasMCSchedPredicates(T);
|
|
|
|
}))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2016-02-13 07:03:32 +01:00
|
|
|
VariantClasses.push_back(SC.Index);
|
2012-09-18 05:41:43 +02:00
|
|
|
}
|
2018-08-10 12:43:43 +02:00
|
|
|
}
|
2018-04-26 20:03:24 +02:00
|
|
|
|
2020-09-27 00:57:09 +02:00
|
|
|
static void collectProcessorIndices(const CodeGenSchedClass &SC,
|
|
|
|
IdxVec &ProcIndices) {
|
2018-08-10 12:43:43 +02:00
|
|
|
// A variant scheduling class may define transitions for multiple
|
|
|
|
// processors. This function identifies wich processors are associated with
|
|
|
|
// transition rules specified by variant class `SC`.
|
|
|
|
for (const CodeGenSchedTransition &T : SC.Transitions) {
|
|
|
|
IdxVec PI;
|
2020-12-07 09:53:33 +01:00
|
|
|
std::set_union(&T.ProcIndex, &T.ProcIndex + 1, ProcIndices.begin(),
|
|
|
|
ProcIndices.end(), std::back_inserter(PI));
|
2018-08-10 12:43:43 +02:00
|
|
|
ProcIndices.swap(PI);
|
|
|
|
}
|
|
|
|
}
|
2018-05-25 17:55:37 +02:00
|
|
|
|
2020-11-24 09:43:51 +01:00
|
|
|
static bool isAlwaysTrue(const CodeGenSchedTransition &T) {
|
|
|
|
return llvm::all_of(T.PredTerm,
|
|
|
|
[](const Record *R) { return isTruePredicate(R); });
|
|
|
|
}
|
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
void SubtargetEmitter::emitSchedModelHelpersImpl(
|
|
|
|
raw_ostream &OS, bool OnlyExpandMCInstPredicates) {
|
|
|
|
IdxVec VariantClasses;
|
|
|
|
collectVariantClasses(SchedModels, VariantClasses,
|
|
|
|
OnlyExpandMCInstPredicates);
|
2018-05-25 17:55:37 +02:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
if (VariantClasses.empty()) {
|
|
|
|
emitSchedModelHelperEpilogue(OS, OnlyExpandMCInstPredicates);
|
|
|
|
return;
|
|
|
|
}
|
2018-05-27 21:08:12 +02:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
// Construct a switch statement where the condition is a check on the
|
|
|
|
// scheduling class identifier. There is a `case` for every variant class
|
|
|
|
// defined by the processor models of this target.
|
|
|
|
// Each `case` implements a number of rules to resolve (i.e. to transition from)
|
|
|
|
// a variant scheduling class to another scheduling class. Rules are
|
|
|
|
// described by instances of CodeGenSchedTransition. Note that transitions may
|
|
|
|
// not be valid for all processors.
|
|
|
|
OS << " switch (SchedClass) {\n";
|
|
|
|
for (unsigned VC : VariantClasses) {
|
|
|
|
IdxVec ProcIndices;
|
|
|
|
const CodeGenSchedClass &SC = SchedModels.getSchedClass(VC);
|
|
|
|
collectProcessorIndices(SC, ProcIndices);
|
|
|
|
|
|
|
|
OS << " case " << VC << ": // " << SC.Name << '\n';
|
|
|
|
|
2018-08-14 20:36:54 +02:00
|
|
|
PredicateExpander PE(Target);
|
2018-08-10 12:43:43 +02:00
|
|
|
PE.setByRef(false);
|
|
|
|
PE.setExpandForMC(OnlyExpandMCInstPredicates);
|
|
|
|
for (unsigned PI : ProcIndices) {
|
|
|
|
OS << " ";
|
2018-11-23 22:17:33 +01:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
// Emit a guard on the processor ID.
|
|
|
|
if (PI != 0) {
|
|
|
|
OS << (OnlyExpandMCInstPredicates
|
|
|
|
? "if (CPUID == "
|
|
|
|
: "if (SchedModel->getProcessorID() == ");
|
|
|
|
OS << PI << ") ";
|
2018-05-25 17:55:37 +02:00
|
|
|
OS << "{ // " << (SchedModels.procModelBegin() + PI)->ModelName << '\n';
|
2018-08-10 12:43:43 +02:00
|
|
|
}
|
2018-04-26 20:03:24 +02:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
// Now emit transitions associated with processor PI.
|
2020-11-24 09:43:51 +01:00
|
|
|
const CodeGenSchedTransition *FinalT = nullptr;
|
2018-08-10 12:43:43 +02:00
|
|
|
for (const CodeGenSchedTransition &T : SC.Transitions) {
|
2020-12-07 09:53:33 +01:00
|
|
|
if (PI != 0 && T.ProcIndex != PI)
|
2018-08-10 12:43:43 +02:00
|
|
|
continue;
|
2018-11-23 22:17:33 +01:00
|
|
|
|
|
|
|
// Emit only transitions based on MCSchedPredicate, if it's the case.
|
|
|
|
// At least the transition specified by NoSchedPred is emitted,
|
|
|
|
// which becomes the default transition for those variants otherwise
|
|
|
|
// not based on MCSchedPredicate.
|
|
|
|
// FIXME: preferably, llvm-mca should instead assume a reasonable
|
|
|
|
// default when a variant transition is not based on MCSchedPredicate
|
|
|
|
// for a given processor.
|
|
|
|
if (OnlyExpandMCInstPredicates && !hasMCSchedPredicates(T))
|
|
|
|
continue;
|
|
|
|
|
2020-11-24 09:43:51 +01:00
|
|
|
// If transition is folded to 'return X' it should be the last one.
|
|
|
|
if (isAlwaysTrue(T)) {
|
|
|
|
FinalT = &T;
|
|
|
|
continue;
|
|
|
|
}
|
2018-08-13 17:13:35 +02:00
|
|
|
PE.setIndentLevel(3);
|
2018-08-10 12:43:43 +02:00
|
|
|
emitPredicates(T, SchedModels.getSchedClass(T.ToClassIdx), PE, OS);
|
2012-09-18 05:41:43 +02:00
|
|
|
}
|
2020-11-24 09:43:51 +01:00
|
|
|
if (FinalT)
|
|
|
|
emitPredicates(*FinalT, SchedModels.getSchedClass(FinalT->ToClassIdx),
|
|
|
|
PE, OS);
|
2018-08-10 12:43:43 +02:00
|
|
|
|
|
|
|
OS << " }\n";
|
2018-11-23 22:17:33 +01:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
if (PI == 0)
|
|
|
|
break;
|
2012-09-18 05:41:43 +02:00
|
|
|
}
|
2018-05-27 21:08:12 +02:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
if (SC.isInferred())
|
|
|
|
OS << " return " << SC.Index << ";\n";
|
|
|
|
OS << " break;\n";
|
2012-09-18 05:41:43 +02:00
|
|
|
}
|
2018-05-25 17:55:37 +02:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
OS << " };\n";
|
2018-05-25 17:55:37 +02:00
|
|
|
|
2018-08-10 12:43:43 +02:00
|
|
|
emitSchedModelHelperEpilogue(OS, OnlyExpandMCInstPredicates);
|
2018-05-25 17:55:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void SubtargetEmitter::EmitSchedModelHelpers(const std::string &ClassName,
|
|
|
|
raw_ostream &OS) {
|
|
|
|
OS << "unsigned " << ClassName
|
|
|
|
<< "\n::resolveSchedClass(unsigned SchedClass, const MachineInstr *MI,"
|
|
|
|
<< " const TargetSchedModel *SchedModel) const {\n";
|
|
|
|
|
|
|
|
// Emit the predicate prolog code.
|
|
|
|
emitPredicateProlog(Records, OS);
|
|
|
|
|
|
|
|
// Emit target predicates.
|
|
|
|
emitSchedModelHelpersImpl(OS);
|
2018-10-25 09:44:01 +02:00
|
|
|
|
2018-05-31 15:30:42 +02:00
|
|
|
OS << "} // " << ClassName << "::resolveSchedClass\n\n";
|
2018-05-25 17:55:37 +02:00
|
|
|
|
2018-05-31 15:30:42 +02:00
|
|
|
OS << "unsigned " << ClassName
|
|
|
|
<< "\n::resolveVariantSchedClass(unsigned SchedClass, const MCInst *MI,"
|
2020-10-19 10:37:54 +02:00
|
|
|
<< " const MCInstrInfo *MCII, unsigned CPUID) const {\n"
|
2018-05-31 15:30:42 +02:00
|
|
|
<< " return " << Target << "_MC"
|
2020-10-19 10:37:54 +02:00
|
|
|
<< "::resolveVariantSchedClassImpl(SchedClass, MI, MCII, CPUID);\n"
|
[TableGen][SubtargetEmitter] Add the ability for processor models to describe dependency breaking instructions.
This patch adds the ability for processor models to describe dependency breaking
instructions.
Different processors may specify a different set of dependency-breaking
instructions.
That means, we cannot assume that all processors of the same target would use
the same rules to classify dependency breaking instructions.
The main goal of this patch is to provide the means to describe dependency
breaking instructions directly via tablegen, and have the following
TargetSubtargetInfo hooks redefined in overrides by tabegen'd
XXXGenSubtargetInfo classes (here, XXX is a Target name).
```
virtual bool isZeroIdiom(const MachineInstr *MI, APInt &Mask) const {
return false;
}
virtual bool isDependencyBreaking(const MachineInstr *MI, APInt &Mask) const {
return isZeroIdiom(MI);
}
```
An instruction MI is a dependency-breaking instruction if a call to method
isDependencyBreaking(MI) on the STI (TargetSubtargetInfo object) evaluates to
true. Similarly, an instruction MI is a special case of zero-idiom dependency
breaking instruction if a call to STI.isZeroIdiom(MI) returns true.
The extra APInt is used for those targets that may want to select which machine
operands have their dependency broken (see comments in code).
Note that by default, subtargets don't know about the existence of
dependency-breaking. In the absence of external information, those method calls
would always return false.
A new tablegen class named STIPredicate has been added by this patch to let
processor models classify instructions that have properties in common. The idea
is that, a MCInstrPredicate definition can be used to "generate" an instruction
equivalence class, with the idea that instructions of a same class all have a
property in common.
STIPredicate definitions are essentially a collection of instruction equivalence
classes.
Also, different processor models can specify a different variant of the same
STIPredicate with different rules (i.e. predicates) to classify instructions.
Tablegen backends (in this particular case, the SubtargetEmitter) will be able
to process STIPredicate definitions, and automatically generate functions in
XXXGenSubtargetInfo.
This patch introduces two special kind of STIPredicate classes named
IsZeroIdiomFunction and IsDepBreakingFunction in tablegen. It also adds a
definition for those in the BtVer2 scheduling model only.
This patch supersedes the one committed at r338372 (phabricator review: D49310).
The main advantages are:
- We can describe subtarget predicates via tablegen using STIPredicates.
- We can describe zero-idioms / dep-breaking instructions directly via
tablegen in the scheduling models.
In future, the STIPredicates framework can be used for solving other problems.
Examples of future developments are:
- Teach how to identify optimizable register-register moves
- Teach how to identify slow LEA instructions (each subtarget defining its own
concept of "slow" LEA).
- Teach how to identify instructions that have undocumented false dependencies
on the output registers on some processors only.
It is also (in my opinion) an elegant way to expose knowledge to both external
tools like llvm-mca, and codegen passes.
For example, machine schedulers in LLVM could reuse that information when
internally constructing the data dependency graph for a code region.
This new design feature is also an "opt-in" feature. Processor models don't have
to use the new STIPredicates. It has all been designed to be as unintrusive as
possible.
Differential Revision: https://reviews.llvm.org/D52174
llvm-svn: 342555
2018-09-19 17:57:45 +02:00
|
|
|
<< "} // " << ClassName << "::resolveVariantSchedClass\n\n";
|
|
|
|
|
|
|
|
STIPredicateExpander PE(Target);
|
|
|
|
PE.setClassPrefix(ClassName);
|
|
|
|
PE.setExpandDefinition(true);
|
|
|
|
PE.setByRef(false);
|
|
|
|
PE.setIndentLevel(0);
|
|
|
|
|
|
|
|
for (const STIPredicateFunction &Fn : SchedModels.getSTIPredicates())
|
|
|
|
PE.expandSTIPredicate(OS, Fn);
|
2012-09-18 05:41:43 +02:00
|
|
|
}
|
|
|
|
|
2017-09-14 22:44:20 +02:00
|
|
|
void SubtargetEmitter::EmitHwModeCheck(const std::string &ClassName,
|
|
|
|
raw_ostream &OS) {
|
|
|
|
const CodeGenHwModes &CGH = TGT.getHwModes();
|
|
|
|
assert(CGH.getNumModeIds() > 0);
|
|
|
|
if (CGH.getNumModeIds() == 1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
OS << "unsigned " << ClassName << "::getHwMode() const {\n";
|
|
|
|
for (unsigned M = 1, NumModes = CGH.getNumModeIds(); M != NumModes; ++M) {
|
|
|
|
const HwMode &HM = CGH.getMode(M);
|
|
|
|
OS << " if (checkFeatures(\"" << HM.Features
|
|
|
|
<< "\")) return " << M << ";\n";
|
|
|
|
}
|
|
|
|
OS << " return 0;\n}\n";
|
|
|
|
}
|
|
|
|
|
2005-10-26 19:30:34 +02:00
|
|
|
//
|
|
|
|
// ParseFeaturesFunction - Produces a subtarget specific function for parsing
|
|
|
|
// the subtarget features string.
|
|
|
|
//
|
2011-07-01 22:45:01 +02:00
|
|
|
void SubtargetEmitter::ParseFeaturesFunction(raw_ostream &OS,
|
|
|
|
unsigned NumFeatures,
|
|
|
|
unsigned NumProcs) {
|
2005-10-28 23:47:29 +02:00
|
|
|
std::vector<Record*> Features =
|
|
|
|
Records.getAllDerivedDefinitions("SubtargetFeature");
|
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
2018-09-27 04:13:45 +02:00
|
|
|
llvm::sort(Features, LessRecord());
|
2005-10-26 19:30:34 +02:00
|
|
|
|
2011-04-01 03:56:55 +02:00
|
|
|
OS << "// ParseSubtargetFeatures - Parses features string setting specified\n"
|
|
|
|
<< "// subtarget options.\n"
|
2011-06-30 03:53:36 +02:00
|
|
|
<< "void llvm::";
|
2005-10-26 19:30:34 +02:00
|
|
|
OS << Target;
|
2020-08-14 23:56:54 +02:00
|
|
|
OS << "Subtarget::ParseSubtargetFeatures(StringRef CPU, StringRef TuneCPU, "
|
|
|
|
<< "StringRef FS) {\n"
|
2018-05-14 14:53:11 +02:00
|
|
|
<< " LLVM_DEBUG(dbgs() << \"\\nFeatures:\" << FS);\n"
|
2020-10-07 11:01:18 +02:00
|
|
|
<< " LLVM_DEBUG(dbgs() << \"\\nCPU:\" << CPU);\n"
|
|
|
|
<< " LLVM_DEBUG(dbgs() << \"\\nTuneCPU:\" << TuneCPU << \"\\n\\n\");\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
if (Features.empty()) {
|
|
|
|
OS << "}\n";
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2020-08-14 23:56:54 +02:00
|
|
|
OS << " InitMCProcessorInfo(CPU, TuneCPU, FS);\n"
|
2020-11-06 15:19:59 +01:00
|
|
|
<< " const FeatureBitset &Bits = getFeatureBits();\n";
|
2007-05-04 22:38:40 +02:00
|
|
|
|
2016-02-13 07:03:32 +01:00
|
|
|
for (Record *R : Features) {
|
2005-10-28 23:47:29 +02:00
|
|
|
// Next record
|
2017-05-31 23:12:46 +02:00
|
|
|
StringRef Instance = R->getName();
|
|
|
|
StringRef Value = R->getValueAsString("Value");
|
|
|
|
StringRef Attribute = R->getValueAsString("Attribute");
|
2006-01-27 09:09:42 +01:00
|
|
|
|
2008-02-15 00:35:16 +01:00
|
|
|
if (Value=="true" || Value=="false")
|
2015-05-26 12:47:10 +02:00
|
|
|
OS << " if (Bits[" << Target << "::"
|
|
|
|
<< Instance << "]) "
|
2008-02-15 00:35:16 +01:00
|
|
|
<< Attribute << " = " << Value << ";\n";
|
|
|
|
else
|
2015-05-26 12:47:10 +02:00
|
|
|
OS << " if (Bits[" << Target << "::"
|
|
|
|
<< Instance << "] && "
|
2011-07-01 22:45:01 +02:00
|
|
|
<< Attribute << " < " << Value << ") "
|
|
|
|
<< Attribute << " = " << Value << ";\n";
|
2005-11-01 21:06:59 +01:00
|
|
|
}
|
2009-05-23 21:50:50 +02:00
|
|
|
|
2011-06-30 03:53:36 +02:00
|
|
|
OS << "}\n";
|
2005-10-26 19:30:34 +02:00
|
|
|
}
|
|
|
|
|
2018-05-25 18:02:43 +02:00
|
|
|
void SubtargetEmitter::emitGenMCSubtargetInfo(raw_ostream &OS) {
|
2018-05-31 15:30:42 +02:00
|
|
|
OS << "namespace " << Target << "_MC {\n"
|
|
|
|
<< "unsigned resolveVariantSchedClassImpl(unsigned SchedClass,\n"
|
2020-10-19 10:37:54 +02:00
|
|
|
<< " const MCInst *MI, const MCInstrInfo *MCII, unsigned CPUID) {\n";
|
2018-05-31 15:30:42 +02:00
|
|
|
emitSchedModelHelpersImpl(OS, /* OnlyExpandMCPredicates */ true);
|
|
|
|
OS << "}\n";
|
2019-08-25 12:47:30 +02:00
|
|
|
OS << "} // end namespace " << Target << "_MC\n\n";
|
2018-05-31 15:30:42 +02:00
|
|
|
|
2018-05-25 18:02:43 +02:00
|
|
|
OS << "struct " << Target
|
|
|
|
<< "GenMCSubtargetInfo : public MCSubtargetInfo {\n";
|
2020-08-14 23:56:54 +02:00
|
|
|
OS << " " << Target << "GenMCSubtargetInfo(const Triple &TT,\n"
|
|
|
|
<< " StringRef CPU, StringRef TuneCPU, StringRef FS,\n"
|
|
|
|
<< " ArrayRef<SubtargetFeatureKV> PF,\n"
|
2019-03-05 19:54:34 +01:00
|
|
|
<< " ArrayRef<SubtargetSubTypeKV> PD,\n"
|
2018-05-25 18:02:43 +02:00
|
|
|
<< " const MCWriteProcResEntry *WPR,\n"
|
|
|
|
<< " const MCWriteLatencyEntry *WL,\n"
|
|
|
|
<< " const MCReadAdvanceEntry *RA, const InstrStage *IS,\n"
|
|
|
|
<< " const unsigned *OC, const unsigned *FP) :\n"
|
2020-08-14 23:56:54 +02:00
|
|
|
<< " MCSubtargetInfo(TT, CPU, TuneCPU, FS, PF, PD,\n"
|
2018-05-25 18:02:43 +02:00
|
|
|
<< " WPR, WL, RA, IS, OC, FP) { }\n\n"
|
|
|
|
<< " unsigned resolveVariantSchedClass(unsigned SchedClass,\n"
|
2020-10-19 10:37:54 +02:00
|
|
|
<< " const MCInst *MI, const MCInstrInfo *MCII,\n"
|
|
|
|
<< " unsigned CPUID) const override {\n"
|
2018-05-31 15:30:42 +02:00
|
|
|
<< " return " << Target << "_MC"
|
2020-11-06 15:19:59 +01:00
|
|
|
<< "::resolveVariantSchedClassImpl(SchedClass, MI, MCII, CPUID);\n";
|
2018-05-25 18:02:43 +02:00
|
|
|
OS << " }\n";
|
2019-09-19 15:39:54 +02:00
|
|
|
if (TGT.getHwModes().getNumModeIds() > 1)
|
|
|
|
OS << " unsigned getHwMode() const override;\n";
|
2018-05-25 18:02:43 +02:00
|
|
|
OS << "};\n";
|
2019-09-19 15:39:54 +02:00
|
|
|
EmitHwModeCheck(Target + "GenMCSubtargetInfo", OS);
|
2018-05-25 18:02:43 +02:00
|
|
|
}
|
|
|
|
|
[TableGen][SubtargetEmitter] Add the ability for processor models to describe dependency breaking instructions.
This patch adds the ability for processor models to describe dependency breaking
instructions.
Different processors may specify a different set of dependency-breaking
instructions.
That means, we cannot assume that all processors of the same target would use
the same rules to classify dependency breaking instructions.
The main goal of this patch is to provide the means to describe dependency
breaking instructions directly via tablegen, and have the following
TargetSubtargetInfo hooks redefined in overrides by tabegen'd
XXXGenSubtargetInfo classes (here, XXX is a Target name).
```
virtual bool isZeroIdiom(const MachineInstr *MI, APInt &Mask) const {
return false;
}
virtual bool isDependencyBreaking(const MachineInstr *MI, APInt &Mask) const {
return isZeroIdiom(MI);
}
```
An instruction MI is a dependency-breaking instruction if a call to method
isDependencyBreaking(MI) on the STI (TargetSubtargetInfo object) evaluates to
true. Similarly, an instruction MI is a special case of zero-idiom dependency
breaking instruction if a call to STI.isZeroIdiom(MI) returns true.
The extra APInt is used for those targets that may want to select which machine
operands have their dependency broken (see comments in code).
Note that by default, subtargets don't know about the existence of
dependency-breaking. In the absence of external information, those method calls
would always return false.
A new tablegen class named STIPredicate has been added by this patch to let
processor models classify instructions that have properties in common. The idea
is that, a MCInstrPredicate definition can be used to "generate" an instruction
equivalence class, with the idea that instructions of a same class all have a
property in common.
STIPredicate definitions are essentially a collection of instruction equivalence
classes.
Also, different processor models can specify a different variant of the same
STIPredicate with different rules (i.e. predicates) to classify instructions.
Tablegen backends (in this particular case, the SubtargetEmitter) will be able
to process STIPredicate definitions, and automatically generate functions in
XXXGenSubtargetInfo.
This patch introduces two special kind of STIPredicate classes named
IsZeroIdiomFunction and IsDepBreakingFunction in tablegen. It also adds a
definition for those in the BtVer2 scheduling model only.
This patch supersedes the one committed at r338372 (phabricator review: D49310).
The main advantages are:
- We can describe subtarget predicates via tablegen using STIPredicates.
- We can describe zero-idioms / dep-breaking instructions directly via
tablegen in the scheduling models.
In future, the STIPredicates framework can be used for solving other problems.
Examples of future developments are:
- Teach how to identify optimizable register-register moves
- Teach how to identify slow LEA instructions (each subtarget defining its own
concept of "slow" LEA).
- Teach how to identify instructions that have undocumented false dependencies
on the output registers on some processors only.
It is also (in my opinion) an elegant way to expose knowledge to both external
tools like llvm-mca, and codegen passes.
For example, machine schedulers in LLVM could reuse that information when
internally constructing the data dependency graph for a code region.
This new design feature is also an "opt-in" feature. Processor models don't have
to use the new STIPredicates. It has all been designed to be as unintrusive as
possible.
Differential Revision: https://reviews.llvm.org/D52174
llvm-svn: 342555
2018-09-19 17:57:45 +02:00
|
|
|
void SubtargetEmitter::EmitMCInstrAnalysisPredicateFunctions(raw_ostream &OS) {
|
|
|
|
OS << "\n#ifdef GET_STIPREDICATE_DECLS_FOR_MC_ANALYSIS\n";
|
|
|
|
OS << "#undef GET_STIPREDICATE_DECLS_FOR_MC_ANALYSIS\n\n";
|
|
|
|
|
|
|
|
STIPredicateExpander PE(Target);
|
|
|
|
PE.setExpandForMC(true);
|
|
|
|
PE.setByRef(true);
|
|
|
|
for (const STIPredicateFunction &Fn : SchedModels.getSTIPredicates())
|
|
|
|
PE.expandSTIPredicate(OS, Fn);
|
|
|
|
|
|
|
|
OS << "#endif // GET_STIPREDICATE_DECLS_FOR_MC_ANALYSIS\n\n";
|
|
|
|
|
|
|
|
OS << "\n#ifdef GET_STIPREDICATE_DEFS_FOR_MC_ANALYSIS\n";
|
|
|
|
OS << "#undef GET_STIPREDICATE_DEFS_FOR_MC_ANALYSIS\n\n";
|
|
|
|
|
|
|
|
std::string ClassPrefix = Target + "MCInstrAnalysis";
|
|
|
|
PE.setExpandDefinition(true);
|
|
|
|
PE.setClassPrefix(ClassPrefix);
|
|
|
|
PE.setIndentLevel(0);
|
|
|
|
for (const STIPredicateFunction &Fn : SchedModels.getSTIPredicates())
|
|
|
|
PE.expandSTIPredicate(OS, Fn);
|
|
|
|
|
|
|
|
OS << "#endif // GET_STIPREDICATE_DEFS_FOR_MC_ANALYSIS\n\n";
|
|
|
|
}
|
|
|
|
|
2009-05-23 21:50:50 +02:00
|
|
|
//
|
2005-10-25 17:16:36 +02:00
|
|
|
// SubtargetEmitter::run - Main subtarget enumeration emitter.
|
|
|
|
//
|
2009-07-03 02:10:29 +02:00
|
|
|
void SubtargetEmitter::run(raw_ostream &OS) {
|
2012-06-11 17:37:55 +02:00
|
|
|
emitSourceFileHeader("Subtarget Enumeration Source Fragment", OS);
|
2005-10-25 17:16:36 +02:00
|
|
|
|
2011-07-08 03:53:10 +02:00
|
|
|
OS << "\n#ifdef GET_SUBTARGETINFO_ENUM\n";
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#undef GET_SUBTARGETINFO_ENUM\n\n";
|
2011-07-08 03:53:10 +02:00
|
|
|
|
2019-03-01 03:19:26 +01:00
|
|
|
DenseMap<Record *, unsigned> FeatureMap;
|
|
|
|
|
2011-07-08 03:53:10 +02:00
|
|
|
OS << "namespace llvm {\n";
|
2019-03-01 03:19:26 +01:00
|
|
|
Enumeration(OS, FeatureMap);
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "} // end namespace llvm\n\n";
|
2011-07-08 03:53:10 +02:00
|
|
|
OS << "#endif // GET_SUBTARGETINFO_ENUM\n\n";
|
|
|
|
|
2011-07-01 22:45:01 +02:00
|
|
|
OS << "\n#ifdef GET_SUBTARGETINFO_MC_DESC\n";
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#undef GET_SUBTARGETINFO_MC_DESC\n\n";
|
2010-04-18 22:31:01 +02:00
|
|
|
|
2011-07-01 22:45:01 +02:00
|
|
|
OS << "namespace llvm {\n";
|
2011-07-14 22:59:42 +02:00
|
|
|
#if 0
|
|
|
|
OS << "namespace {\n";
|
|
|
|
#endif
|
2019-03-01 03:19:26 +01:00
|
|
|
unsigned NumFeatures = FeatureKeyValues(OS, FeatureMap);
|
2011-07-14 22:59:42 +02:00
|
|
|
OS << "\n";
|
2012-07-07 06:00:00 +02:00
|
|
|
EmitSchedModel(OS);
|
2011-07-14 22:59:42 +02:00
|
|
|
OS << "\n";
|
2019-03-05 19:54:38 +01:00
|
|
|
unsigned NumProcs = CPUKeyValues(OS, FeatureMap);
|
|
|
|
OS << "\n";
|
2011-07-14 22:59:42 +02:00
|
|
|
#if 0
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "} // end anonymous namespace\n\n";
|
2011-07-14 22:59:42 +02:00
|
|
|
#endif
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
// MCInstrInfo initialization routine.
|
2018-05-25 18:02:43 +02:00
|
|
|
emitGenMCSubtargetInfo(OS);
|
|
|
|
|
2017-10-24 17:50:55 +02:00
|
|
|
OS << "\nstatic inline MCSubtargetInfo *create" << Target
|
2015-07-11 00:43:42 +02:00
|
|
|
<< "MCSubtargetInfoImpl("
|
2020-08-14 23:56:54 +02:00
|
|
|
<< "const Triple &TT, StringRef CPU, StringRef TuneCPU, StringRef FS) {\n";
|
|
|
|
OS << " return new " << Target
|
|
|
|
<< "GenMCSubtargetInfo(TT, CPU, TuneCPU, FS, ";
|
2011-07-01 22:45:01 +02:00
|
|
|
if (NumFeatures)
|
|
|
|
OS << Target << "FeatureKV, ";
|
|
|
|
else
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << "None, ";
|
2011-07-01 22:45:01 +02:00
|
|
|
if (NumProcs)
|
|
|
|
OS << Target << "SubTypeKV, ";
|
|
|
|
else
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << "None, ";
|
2012-09-18 00:18:50 +02:00
|
|
|
OS << '\n'; OS.indent(22);
|
2019-03-05 19:54:38 +01:00
|
|
|
OS << Target << "WriteProcResTable, "
|
2012-09-18 05:18:56 +02:00
|
|
|
<< Target << "WriteLatencyTable, "
|
|
|
|
<< Target << "ReadAdvanceTable, ";
|
2016-12-09 23:06:55 +01:00
|
|
|
OS << '\n'; OS.indent(22);
|
2013-03-16 19:58:55 +01:00
|
|
|
if (SchedModels.hasItineraries()) {
|
2012-09-18 05:18:56 +02:00
|
|
|
OS << Target << "Stages, "
|
2011-07-01 22:45:01 +02:00
|
|
|
<< Target << "OperandCycles, "
|
2014-05-06 22:23:04 +02:00
|
|
|
<< Target << "ForwardingPaths";
|
2011-07-01 22:45:01 +02:00
|
|
|
} else
|
2016-12-09 23:06:55 +01:00
|
|
|
OS << "nullptr, nullptr, nullptr";
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << ");\n}\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "} // end namespace llvm\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
OS << "#endif // GET_SUBTARGETINFO_MC_DESC\n\n";
|
|
|
|
|
|
|
|
OS << "\n#ifdef GET_SUBTARGETINFO_TARGET_DESC\n";
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#undef GET_SUBTARGETINFO_TARGET_DESC\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
OS << "#include \"llvm/Support/Debug.h\"\n";
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#include \"llvm/Support/raw_ostream.h\"\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
ParseFeaturesFunction(OS, NumFeatures, NumProcs);
|
|
|
|
|
|
|
|
OS << "#endif // GET_SUBTARGETINFO_TARGET_DESC\n\n";
|
|
|
|
|
2011-07-01 23:01:15 +02:00
|
|
|
// Create a TargetSubtargetInfo subclass to hide the MC layer initialization.
|
2011-07-01 22:45:01 +02:00
|
|
|
OS << "\n#ifdef GET_SUBTARGETINFO_HEADER\n";
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#undef GET_SUBTARGETINFO_HEADER\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
std::string ClassName = Target + "GenSubtargetInfo";
|
|
|
|
OS << "namespace llvm {\n";
|
2011-12-01 22:10:21 +01:00
|
|
|
OS << "class DFAPacketizer;\n";
|
2018-05-31 15:30:42 +02:00
|
|
|
OS << "namespace " << Target << "_MC {\n"
|
|
|
|
<< "unsigned resolveVariantSchedClassImpl(unsigned SchedClass,"
|
2020-10-19 10:37:54 +02:00
|
|
|
<< " const MCInst *MI, const MCInstrInfo *MCII, unsigned CPUID);\n"
|
2019-08-25 12:47:30 +02:00
|
|
|
<< "} // end namespace " << Target << "_MC\n\n";
|
2011-07-01 23:01:15 +02:00
|
|
|
OS << "struct " << ClassName << " : public TargetSubtargetInfo {\n"
|
2015-09-15 18:17:27 +02:00
|
|
|
<< " explicit " << ClassName << "(const Triple &TT, StringRef CPU, "
|
2020-08-14 23:56:54 +02:00
|
|
|
<< "StringRef TuneCPU, StringRef FS);\n"
|
2011-12-01 22:10:21 +01:00
|
|
|
<< "public:\n"
|
2015-06-10 14:11:26 +02:00
|
|
|
<< " unsigned resolveSchedClass(unsigned SchedClass, "
|
|
|
|
<< " const MachineInstr *DefMI,"
|
2014-03-09 08:44:38 +01:00
|
|
|
<< " const TargetSchedModel *SchedModel) const override;\n"
|
2018-05-31 15:30:42 +02:00
|
|
|
<< " unsigned resolveVariantSchedClass(unsigned SchedClass,"
|
2020-10-19 10:37:54 +02:00
|
|
|
<< " const MCInst *MI, const MCInstrInfo *MCII,"
|
|
|
|
<< " unsigned CPUID) const override;\n"
|
2011-12-06 18:34:16 +01:00
|
|
|
<< " DFAPacketizer *createDFAPacketizer(const InstrItineraryData *IID)"
|
2017-09-14 22:44:20 +02:00
|
|
|
<< " const;\n";
|
|
|
|
if (TGT.getHwModes().getNumModeIds() > 1)
|
|
|
|
OS << " unsigned getHwMode() const override;\n";
|
[TableGen][SubtargetEmitter] Add the ability for processor models to describe dependency breaking instructions.
This patch adds the ability for processor models to describe dependency breaking
instructions.
Different processors may specify a different set of dependency-breaking
instructions.
That means, we cannot assume that all processors of the same target would use
the same rules to classify dependency breaking instructions.
The main goal of this patch is to provide the means to describe dependency
breaking instructions directly via tablegen, and have the following
TargetSubtargetInfo hooks redefined in overrides by tabegen'd
XXXGenSubtargetInfo classes (here, XXX is a Target name).
```
virtual bool isZeroIdiom(const MachineInstr *MI, APInt &Mask) const {
return false;
}
virtual bool isDependencyBreaking(const MachineInstr *MI, APInt &Mask) const {
return isZeroIdiom(MI);
}
```
An instruction MI is a dependency-breaking instruction if a call to method
isDependencyBreaking(MI) on the STI (TargetSubtargetInfo object) evaluates to
true. Similarly, an instruction MI is a special case of zero-idiom dependency
breaking instruction if a call to STI.isZeroIdiom(MI) returns true.
The extra APInt is used for those targets that may want to select which machine
operands have their dependency broken (see comments in code).
Note that by default, subtargets don't know about the existence of
dependency-breaking. In the absence of external information, those method calls
would always return false.
A new tablegen class named STIPredicate has been added by this patch to let
processor models classify instructions that have properties in common. The idea
is that, a MCInstrPredicate definition can be used to "generate" an instruction
equivalence class, with the idea that instructions of a same class all have a
property in common.
STIPredicate definitions are essentially a collection of instruction equivalence
classes.
Also, different processor models can specify a different variant of the same
STIPredicate with different rules (i.e. predicates) to classify instructions.
Tablegen backends (in this particular case, the SubtargetEmitter) will be able
to process STIPredicate definitions, and automatically generate functions in
XXXGenSubtargetInfo.
This patch introduces two special kind of STIPredicate classes named
IsZeroIdiomFunction and IsDepBreakingFunction in tablegen. It also adds a
definition for those in the BtVer2 scheduling model only.
This patch supersedes the one committed at r338372 (phabricator review: D49310).
The main advantages are:
- We can describe subtarget predicates via tablegen using STIPredicates.
- We can describe zero-idioms / dep-breaking instructions directly via
tablegen in the scheduling models.
In future, the STIPredicates framework can be used for solving other problems.
Examples of future developments are:
- Teach how to identify optimizable register-register moves
- Teach how to identify slow LEA instructions (each subtarget defining its own
concept of "slow" LEA).
- Teach how to identify instructions that have undocumented false dependencies
on the output registers on some processors only.
It is also (in my opinion) an elegant way to expose knowledge to both external
tools like llvm-mca, and codegen passes.
For example, machine schedulers in LLVM could reuse that information when
internally constructing the data dependency graph for a code region.
This new design feature is also an "opt-in" feature. Processor models don't have
to use the new STIPredicates. It has all been designed to be as unintrusive as
possible.
Differential Revision: https://reviews.llvm.org/D52174
llvm-svn: 342555
2018-09-19 17:57:45 +02:00
|
|
|
|
|
|
|
STIPredicateExpander PE(Target);
|
|
|
|
PE.setByRef(false);
|
|
|
|
for (const STIPredicateFunction &Fn : SchedModels.getSTIPredicates())
|
|
|
|
PE.expandSTIPredicate(OS, Fn);
|
|
|
|
|
2017-09-14 22:44:20 +02:00
|
|
|
OS << "};\n"
|
|
|
|
<< "} // end namespace llvm\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
OS << "#endif // GET_SUBTARGETINFO_HEADER\n\n";
|
|
|
|
|
|
|
|
OS << "\n#ifdef GET_SUBTARGETINFO_CTOR\n";
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#undef GET_SUBTARGETINFO_CTOR\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "#include \"llvm/CodeGen/TargetSchedule.h\"\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
OS << "namespace llvm {\n";
|
2011-10-22 18:50:00 +02:00
|
|
|
OS << "extern const llvm::SubtargetFeatureKV " << Target << "FeatureKV[];\n";
|
2019-03-05 19:54:34 +01:00
|
|
|
OS << "extern const llvm::SubtargetSubTypeKV " << Target << "SubTypeKV[];\n";
|
2012-09-18 00:18:50 +02:00
|
|
|
OS << "extern const llvm::MCWriteProcResEntry "
|
|
|
|
<< Target << "WriteProcResTable[];\n";
|
|
|
|
OS << "extern const llvm::MCWriteLatencyEntry "
|
|
|
|
<< Target << "WriteLatencyTable[];\n";
|
|
|
|
OS << "extern const llvm::MCReadAdvanceEntry "
|
|
|
|
<< Target << "ReadAdvanceTable[];\n";
|
|
|
|
|
2013-03-16 19:58:55 +01:00
|
|
|
if (SchedModels.hasItineraries()) {
|
2011-10-22 18:50:00 +02:00
|
|
|
OS << "extern const llvm::InstrStage " << Target << "Stages[];\n";
|
|
|
|
OS << "extern const unsigned " << Target << "OperandCycles[];\n";
|
2012-07-07 05:59:48 +02:00
|
|
|
OS << "extern const unsigned " << Target << "ForwardingPaths[];\n";
|
2011-07-14 22:59:42 +02:00
|
|
|
}
|
|
|
|
|
2015-09-15 18:17:27 +02:00
|
|
|
OS << ClassName << "::" << ClassName << "(const Triple &TT, StringRef CPU, "
|
2020-08-14 23:56:54 +02:00
|
|
|
<< "StringRef TuneCPU, StringRef FS)\n"
|
|
|
|
<< " : TargetSubtargetInfo(TT, CPU, TuneCPU, FS, ";
|
2011-07-01 22:45:01 +02:00
|
|
|
if (NumFeatures)
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << "makeArrayRef(" << Target << "FeatureKV, " << NumFeatures << "), ";
|
2011-07-01 22:45:01 +02:00
|
|
|
else
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << "None, ";
|
2011-07-01 22:45:01 +02:00
|
|
|
if (NumProcs)
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << "makeArrayRef(" << Target << "SubTypeKV, " << NumProcs << "), ";
|
2011-07-01 22:45:01 +02:00
|
|
|
else
|
2014-05-06 22:23:04 +02:00
|
|
|
OS << "None, ";
|
2015-07-11 00:43:42 +02:00
|
|
|
OS << '\n'; OS.indent(24);
|
2019-03-05 19:54:38 +01:00
|
|
|
OS << Target << "WriteProcResTable, "
|
2012-09-18 05:18:56 +02:00
|
|
|
<< Target << "WriteLatencyTable, "
|
|
|
|
<< Target << "ReadAdvanceTable, ";
|
2015-07-11 00:43:42 +02:00
|
|
|
OS << '\n'; OS.indent(24);
|
2013-03-16 19:58:55 +01:00
|
|
|
if (SchedModels.hasItineraries()) {
|
2012-09-18 05:18:56 +02:00
|
|
|
OS << Target << "Stages, "
|
2011-07-01 22:45:01 +02:00
|
|
|
<< Target << "OperandCycles, "
|
2014-05-06 22:23:04 +02:00
|
|
|
<< Target << "ForwardingPaths";
|
2011-07-01 22:45:01 +02:00
|
|
|
} else
|
2016-12-09 23:06:55 +01:00
|
|
|
OS << "nullptr, nullptr, nullptr";
|
2015-07-11 00:43:42 +02:00
|
|
|
OS << ") {}\n\n";
|
2012-09-18 00:18:50 +02:00
|
|
|
|
2012-09-18 05:41:43 +02:00
|
|
|
EmitSchedModelHelpers(ClassName, OS);
|
2017-09-14 22:44:20 +02:00
|
|
|
EmitHwModeCheck(ClassName, OS);
|
2012-09-18 05:41:43 +02:00
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
OS << "} // end namespace llvm\n\n";
|
2011-07-01 22:45:01 +02:00
|
|
|
|
|
|
|
OS << "#endif // GET_SUBTARGETINFO_CTOR\n\n";
|
[TableGen][SubtargetEmitter] Add the ability for processor models to describe dependency breaking instructions.
This patch adds the ability for processor models to describe dependency breaking
instructions.
Different processors may specify a different set of dependency-breaking
instructions.
That means, we cannot assume that all processors of the same target would use
the same rules to classify dependency breaking instructions.
The main goal of this patch is to provide the means to describe dependency
breaking instructions directly via tablegen, and have the following
TargetSubtargetInfo hooks redefined in overrides by tabegen'd
XXXGenSubtargetInfo classes (here, XXX is a Target name).
```
virtual bool isZeroIdiom(const MachineInstr *MI, APInt &Mask) const {
return false;
}
virtual bool isDependencyBreaking(const MachineInstr *MI, APInt &Mask) const {
return isZeroIdiom(MI);
}
```
An instruction MI is a dependency-breaking instruction if a call to method
isDependencyBreaking(MI) on the STI (TargetSubtargetInfo object) evaluates to
true. Similarly, an instruction MI is a special case of zero-idiom dependency
breaking instruction if a call to STI.isZeroIdiom(MI) returns true.
The extra APInt is used for those targets that may want to select which machine
operands have their dependency broken (see comments in code).
Note that by default, subtargets don't know about the existence of
dependency-breaking. In the absence of external information, those method calls
would always return false.
A new tablegen class named STIPredicate has been added by this patch to let
processor models classify instructions that have properties in common. The idea
is that, a MCInstrPredicate definition can be used to "generate" an instruction
equivalence class, with the idea that instructions of a same class all have a
property in common.
STIPredicate definitions are essentially a collection of instruction equivalence
classes.
Also, different processor models can specify a different variant of the same
STIPredicate with different rules (i.e. predicates) to classify instructions.
Tablegen backends (in this particular case, the SubtargetEmitter) will be able
to process STIPredicate definitions, and automatically generate functions in
XXXGenSubtargetInfo.
This patch introduces two special kind of STIPredicate classes named
IsZeroIdiomFunction and IsDepBreakingFunction in tablegen. It also adds a
definition for those in the BtVer2 scheduling model only.
This patch supersedes the one committed at r338372 (phabricator review: D49310).
The main advantages are:
- We can describe subtarget predicates via tablegen using STIPredicates.
- We can describe zero-idioms / dep-breaking instructions directly via
tablegen in the scheduling models.
In future, the STIPredicates framework can be used for solving other problems.
Examples of future developments are:
- Teach how to identify optimizable register-register moves
- Teach how to identify slow LEA instructions (each subtarget defining its own
concept of "slow" LEA).
- Teach how to identify instructions that have undocumented false dependencies
on the output registers on some processors only.
It is also (in my opinion) an elegant way to expose knowledge to both external
tools like llvm-mca, and codegen passes.
For example, machine schedulers in LLVM could reuse that information when
internally constructing the data dependency graph for a code region.
This new design feature is also an "opt-in" feature. Processor models don't have
to use the new STIPredicates. It has all been designed to be as unintrusive as
possible.
Differential Revision: https://reviews.llvm.org/D52174
llvm-svn: 342555
2018-09-19 17:57:45 +02:00
|
|
|
|
|
|
|
EmitMCInstrAnalysisPredicateFunctions(OS);
|
2005-10-25 17:16:36 +02:00
|
|
|
}
|
2012-06-11 17:37:55 +02:00
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
void EmitSubtarget(RecordKeeper &RK, raw_ostream &OS) {
|
2012-07-07 06:00:00 +02:00
|
|
|
CodeGenTarget CGTarget(RK);
|
|
|
|
SubtargetEmitter(RK, CGTarget).run(OS);
|
2012-06-11 17:37:55 +02:00
|
|
|
}
|
|
|
|
|
2016-05-17 19:04:23 +02:00
|
|
|
} // end namespace llvm
|