mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-01-01 00:33:09 +00:00
put instructions into a map instead of a vector for quick lookup
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23368 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
ae6d828de8
commit
ae5b350b3b
@ -326,6 +326,10 @@ bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP) {
|
||||
return MadeChange;
|
||||
} else {
|
||||
assert(getOperator()->isSubClassOf("Instruction") && "Unknown node type!");
|
||||
|
||||
const DAGInstruction &Inst =
|
||||
TP.getDAGISelEmitter().getInstruction(getOperator());
|
||||
|
||||
// TODO: type inference for instructions.
|
||||
return false;
|
||||
}
|
||||
@ -874,13 +878,15 @@ void DAGISelEmitter::ParseInstructions() {
|
||||
new TreePatternNode(I->getRecord(), ResultNodeOperands);
|
||||
|
||||
DEBUG(I->dump());
|
||||
Instructions.push_back(DAGInstruction(I, ResultTypes, OperandTypes,
|
||||
ResultPattern));
|
||||
Instructions.insert(std::make_pair(I->getRecord(),
|
||||
DAGInstruction(I, ResultTypes,
|
||||
OperandTypes, ResultPattern)));
|
||||
}
|
||||
|
||||
// If we can, convert the instructions to be patterns that are matched!
|
||||
for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
|
||||
TreePattern *I = Instructions[i].getPattern();
|
||||
for (std::map<Record*, DAGInstruction>::iterator II = Instructions.begin(),
|
||||
E = Instructions.end(); II != E; ++II) {
|
||||
TreePattern *I = II->second.getPattern();
|
||||
|
||||
if (I->getNumTrees() != 1) {
|
||||
std::cerr << "CANNOT HANDLE: " << I->getRecord()->getName() << " yet!";
|
||||
@ -894,7 +900,7 @@ void DAGISelEmitter::ParseInstructions() {
|
||||
continue; // Not a set of a single value (not handled so far)
|
||||
|
||||
TreePatternNode *SrcPattern = Pattern->getChild(1)->clone();
|
||||
TreePatternNode *DstPattern = Instructions[i].getResultPattern();
|
||||
TreePatternNode *DstPattern = II->second.getResultPattern();
|
||||
PatternsToMatch.push_back(std::make_pair(SrcPattern, DstPattern));
|
||||
}
|
||||
}
|
||||
@ -931,7 +937,7 @@ void DAGISelEmitter::ParsePatterns() {
|
||||
// never do anything with this pattern: report it to the user.
|
||||
#if 0 // FIXME: ENABLE when we can infer though instructions!
|
||||
if (!Result->InferAllTypes())
|
||||
Result->error("Could not infer all types in pattern!");
|
||||
Result->error("Could not infer all types in pattern result!");
|
||||
#endif
|
||||
|
||||
if (Result->getNumTrees() != 1)
|
||||
|
@ -317,7 +317,7 @@ class DAGISelEmitter : public TableGenBackend {
|
||||
std::map<Record*, SDNodeInfo> SDNodes;
|
||||
std::map<Record*, std::pair<Record*, std::string> > SDNodeXForms;
|
||||
std::map<Record*, TreePattern*> PatternFragments;
|
||||
std::vector<DAGInstruction> Instructions;
|
||||
std::map<Record*, DAGInstruction> Instructions;
|
||||
|
||||
/// PatternsToMatch - All of the things we are matching on the DAG. The first
|
||||
/// value is the pattern to match, the second pattern is the result to
|
||||
@ -344,6 +344,11 @@ public:
|
||||
return SDNodeXForms.find(R)->second;
|
||||
}
|
||||
|
||||
const DAGInstruction &getInstruction(Record *R) const {
|
||||
assert(Instructions.count(R) && "Unknown instruction!");
|
||||
return Instructions.find(R)->second;
|
||||
}
|
||||
|
||||
private:
|
||||
void ParseNodeInfo();
|
||||
void ParseNodeTransforms(std::ostream &OS);
|
||||
|
Loading…
Reference in New Issue
Block a user