DFAPacketizerEmitter.cpp [plain text]
#include "llvm/MC/MCInstrDesc.h"
#include "llvm/MC/MCInstrItineraries.h"
#include "llvm/TableGen/Record.h"
#include "CodeGenTarget.h"
#include "DFAPacketizerEmitter.h"
#include <list>
using namespace llvm;
namespace {
class State {
public:
static int currentStateNum;
int stateNum;
bool isInitial;
std::set<unsigned> stateInfo;
State();
State(const State &S);
bool canAddInsnClass(unsigned InsnClass, std::set<unsigned> &PossibleStates);
};
}
namespace {
struct Transition {
public:
static int currentTransitionNum;
int transitionNum;
State *from;
unsigned input;
State *to;
Transition(State *from_, unsigned input_, State *to_);
};
}
namespace {
struct ltState {
bool operator()(const State *s1, const State *s2) const;
};
}
namespace {
class DFA {
public:
DFA();
std::set<State*, ltState> states;
std::map<State*, SmallVector<Transition*, 16>, ltState> stateTransitions;
State *currentState;
unsigned LargestInput;
void initialize();
void addState(State *);
void addTransition(Transition *);
State *getTransition(State *, unsigned);
bool isValidTransition(State *From, unsigned InsnClass);
void writeTableAndAPI(raw_ostream &OS, const std::string &ClassName);
};
}
State::State() :
stateNum(currentStateNum++), isInitial(false) {}
State::State(const State &S) :
stateNum(currentStateNum++), isInitial(S.isInitial),
stateInfo(S.stateInfo) {}
Transition::Transition(State *from_, unsigned input_, State *to_) :
transitionNum(currentTransitionNum++), from(from_), input(input_),
to(to_) {}
DFA::DFA() :
LargestInput(0) {}
bool ltState::operator()(const State *s1, const State *s2) const {
return (s1->stateNum < s2->stateNum);
}
bool State::canAddInsnClass(unsigned InsnClass,
std::set<unsigned> &PossibleStates) {
bool AddedState = false;
for (std::set<unsigned>::iterator SI = stateInfo.begin();
SI != stateInfo.end(); ++SI) {
unsigned thisState = *SI;
DenseSet<unsigned> VisitedResourceStates;
for (unsigned int j = 0; j < sizeof(InsnClass) * 8; ++j) {
if ((0x1 << j) & InsnClass) {
unsigned ResultingResourceState = thisState | (0x1 << j);
if ((ResultingResourceState != thisState) &&
(VisitedResourceStates.count(ResultingResourceState) == 0)) {
VisitedResourceStates.insert(ResultingResourceState);
PossibleStates.insert(ResultingResourceState);
AddedState = true;
}
}
}
}
return AddedState;
}
void DFA::initialize() {
currentState->isInitial = true;
}
void DFA::addState(State *S) {
assert(!states.count(S) && "State already exists");
states.insert(S);
}
void DFA::addTransition(Transition *T) {
if (T->input > LargestInput)
LargestInput = T->input;
stateTransitions[T->from].push_back(T);
}
State *DFA::getTransition(State *From, unsigned I) {
if (!stateTransitions.count(From))
return NULL;
for (SmallVector<Transition*, 16>::iterator VI =
stateTransitions[From].begin();
VI != stateTransitions[From].end(); ++VI)
if ((*VI)->input == I)
return (*VI)->to;
return NULL;
}
bool DFA::isValidTransition(State *From, unsigned InsnClass) {
return (getTransition(From, InsnClass) != NULL);
}
int State::currentStateNum = 0;
int Transition::currentTransitionNum = 0;
DFAGen::DFAGen(RecordKeeper &R):
TargetName(CodeGenTarget(R).getName()),
allInsnClasses(), Records(R) {}
void DFA::writeTableAndAPI(raw_ostream &OS, const std::string &TargetName) {
std::set<State*, ltState>::iterator SI = states.begin();
std::vector<int> StateEntry(states.size());
OS << "namespace llvm {\n\n";
OS << "const int " << TargetName << "DFAStateInputTable[][2] = {\n";
int ValidTransitions = 0;
for (unsigned i = 0; i < states.size(); ++i, ++SI) {
StateEntry[i] = ValidTransitions;
for (unsigned j = 0; j <= LargestInput; ++j) {
assert (((*SI)->stateNum == (int) i) && "Mismatch in state numbers");
if (!isValidTransition(*SI, j))
continue;
OS << "{" << j << ", "
<< getTransition(*SI, j)->stateNum
<< "}, ";
++ValidTransitions;
}
if (ValidTransitions == StateEntry[i]) {
OS << "{-1, -1},";
++ValidTransitions;
}
OS << "\n";
}
OS << "};\n\n";
OS << "const unsigned int " << TargetName << "DFAStateEntryTable[] = {\n";
for (unsigned i = 0; i < states.size(); ++i)
OS << StateEntry[i] << ", ";
OS << "\n};\n";
OS << "} // namespace\n";
std::string SubTargetClassName = TargetName + "GenSubtargetInfo";
OS << "\n" << "#include \"llvm/CodeGen/DFAPacketizer.h\"\n";
OS << "namespace llvm {\n";
OS << "DFAPacketizer *" << SubTargetClassName << "::"
<< "createDFAPacketizer(const InstrItineraryData *IID) const {\n"
<< " return new DFAPacketizer(IID, " << TargetName
<< "DFAStateInputTable, " << TargetName << "DFAStateEntryTable);\n}\n\n";
OS << "} // End llvm namespace \n";
}
void DFAGen::collectAllInsnClasses(const std::string &Name,
Record *ItinData,
unsigned &NStages,
raw_ostream &OS) {
std::vector<Record*> ProcItinList =
Records.getAllDerivedDefinitions("ProcessorItineraries");
if (ProcItinList.size() < 2)
return;
std::map<std::string, unsigned> NameToBitsMap;
for (unsigned i = 0, N = ProcItinList.size(); i < N; ++i) {
Record *Proc = ProcItinList[i];
std::vector<Record*> FUs = Proc->getValueAsListOfDefs("FU");
for (unsigned i = 0, N = FUs.size(); i < N; ++i)
NameToBitsMap[FUs[i]->getName()] = (unsigned) (1U << i);
}
const std::vector<Record*> &StageList =
ItinData->getValueAsListOfDefs("Stages");
NStages = StageList.size();
unsigned UnitBitValue = 0;
for (unsigned i = 0; i < NStages; ++i) {
const Record *Stage = StageList[i];
const std::vector<Record*> &UnitList =
Stage->getValueAsListOfDefs("Units");
for (unsigned j = 0, M = UnitList.size(); j < M; ++j) {
std::string UnitName = UnitList[j]->getName();
assert(NameToBitsMap.count(UnitName));
UnitBitValue |= NameToBitsMap[UnitName];
}
if (UnitBitValue != 0)
allInsnClasses.insert(UnitBitValue);
}
}
void DFAGen::run(raw_ostream &OS) {
EmitSourceFileHeader("Target DFA Packetizer Tables", OS);
std::vector<Record*> ProcItinList =
Records.getAllDerivedDefinitions("ProcessorItineraries");
for (unsigned i = 0, N = ProcItinList.size(); i < N; i++) {
Record *Proc = ProcItinList[i];
const std::string &Name = Proc->getName();
if (Name == "NoItineraries")
continue;
unsigned NItinClasses =
Records.getAllDerivedDefinitions("InstrItinClass").size();
if (NItinClasses == 0)
return;
std::vector<Record*> ItinDataList = Proc->getValueAsListOfDefs("IID");
for (unsigned j = 0, M = ItinDataList.size(); j < M; j++) {
Record *ItinData = ItinDataList[j];
unsigned NStages;
collectAllInsnClasses(Name, ItinData, NStages, OS);
}
}
DFA D;
State *Initial = new State;
Initial->isInitial = true;
Initial->stateInfo.insert(0x0);
D.addState(Initial);
SmallVector<State*, 32> WorkList;
std::map<std::set<unsigned>, State*> Visited;
WorkList.push_back(Initial);
while (!WorkList.empty()) {
State *current = WorkList.pop_back_val();
for (DenseSet<unsigned>::iterator CI = allInsnClasses.begin(),
CE = allInsnClasses.end(); CI != CE; ++CI) {
unsigned InsnClass = *CI;
std::set<unsigned> NewStateResources;
if (!D.getTransition(current, InsnClass) &&
current->canAddInsnClass(InsnClass, NewStateResources)) {
State *NewState = NULL;
std::map<std::set<unsigned>, State*>::iterator VI;
if ((VI = Visited.find(NewStateResources)) != Visited.end())
NewState = VI->second;
else {
NewState = new State;
NewState->stateInfo = NewStateResources;
D.addState(NewState);
Visited[NewStateResources] = NewState;
WorkList.push_back(NewState);
}
Transition *NewTransition = new Transition(current, InsnClass,
NewState);
D.addTransition(NewTransition);
}
}
}
D.writeTableAndAPI(OS, TargetName);
}