6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-08-14 15:28:20 +00:00
Code Issues Projects Releases Wiki Activity

Allows instructions which no explicit operands. e.g. X86 RET which has but

Browse Source 
an implicit flag operand.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@24916 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng
2005-12-21 20:20:49 +00:00
parent 35186bacc3
commit 87bddeb2af
1 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
utils/TableGen/DAGISelEmitter.cpp
View File

@@ -1124,23 +1124,22 @@ void DAGISelEmitter::ParseInstructions() {
std::vector<Record*> Operands; std::vector<Record*> Operands;
CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName()); CodeGenInstruction &InstInfo =Target.getInstruction(Instrs[i]->getName());
// Doesn't even define a result?
if (InstInfo.OperandList.size() == 0)
continue;
// Note: Removed if (InstInfo.OperandList.size() == 0) continue;
// It's possible for some instruction, e.g. RET for X86 that only has an
// implicit flag operand.
// FIXME: temporary hack... // FIXME: temporary hack...
if (InstInfo.isReturn || InstInfo.isBranch || InstInfo.isCall || if (InstInfo.isReturn || InstInfo.isBranch || InstInfo.isCall ||
InstInfo.isStore) { InstInfo.isStore) {
// These produce no results // These produce no results
for (unsigned j = 0, e = InstInfo.OperandList.size(); j != e; ++j) for (unsigned j = 0, e = InstInfo.OperandList.size(); j < e; ++j)
Operands.push_back(InstInfo.OperandList[j].Rec); Operands.push_back(InstInfo.OperandList[j].Rec);
} else { } else {
// Assume the first operand is the result. // Assume the first operand is the result.
Results.push_back(InstInfo.OperandList[0].Rec); Results.push_back(InstInfo.OperandList[0].Rec);
// The rest are inputs. // The rest are inputs.
for (unsigned j = 1, e = InstInfo.OperandList.size(); j != e; ++j) for (unsigned j = 1, e = InstInfo.OperandList.size(); j < e; ++j)
Operands.push_back(InstInfo.OperandList[j].Rec); Operands.push_back(InstInfo.OperandList[j].Rec);
} }