RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-14 03:50:48 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix another bug related to chain / flag.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@24868 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng 2005-12-19 22:40:04 +00:00
parent fcaa9957c9
commit f9fc25db32
1 changed files with 20 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
utils/TableGen/DAGISelEmitter.cpp
View File

@ -2107,21 +2107,33 @@ public:
OS << ");\n"; OS << ");\n";
unsigned ValNo = 0; unsigned ValNo = 0;
for (unsigned i = 0; i < NumResults; i++) for (unsigned i = 0; i < NumResults; i++) {
OS << " CodeGenMap[N.getValue(" << ValNo++ << ")] = Result;\n"; OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result"
<< ".getValue(" << ValNo << ");\n";
ValNo++;
}
if (II.hasCtrlDep) { if (II.hasCtrlDep) {
OS << " Chain "; OS << " Chain ";
if (NodeHasChain(Pattern, ISE)) if (NodeHasChain(Pattern, ISE))
OS << "= CodeGenMap[N.getValue(" << ValNo << ")] "; OS << "= CodeGenMap[N.getValue(" << ValNo + NumImpResults << ")] ";
for (unsigned j = 0, e = FoldedChains.size(); j < e; j++) for (unsigned j = 0, e = FoldedChains.size(); j < e; j++)
OS << "= CodeGenMap[" << FoldedChains[j].first << ".getValue(" OS << "= CodeGenMap[" << FoldedChains[j].first << ".getValue("
<< FoldedChains[j].second << ")] "; << FoldedChains[j].second << ")] ";
OS << "= Result.getValue(" << ValNo++ << ");\n"; OS << "= Result.getValue(" << ValNo << ");\n";
}
for (unsigned i = 0; i < NumImpResults; i++) { for (unsigned i = 0; i < NumImpResults; i++) {
OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result"; OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result";
OS << ".getValue(" << ValNo++ << ");\n"; OS << ".getValue(" << ValNo+1 << ");\n";
ValNo++;
} }
} else {
for (unsigned i = 0; i < NumImpResults; i++) {
OS << " CodeGenMap[N.getValue(" << ValNo << ")] = Result";
OS << ".getValue(" << ValNo << ");\n";
ValNo++;
}
}
OS << " return Result.getValue(N.ResNo);\n"; OS << " return Result.getValue(N.ResNo);\n";
} else { } else {
// If this instruction is the root, and if there is only one use of it, // If this instruction is the root, and if there is only one use of it,