6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-14 11:32:34 +00:00
Code Issues Projects Releases Wiki Activity

remove now dead code and fixme.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@96333 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2010-02-16 06:15:00 +00:00
parent 6e6975d419
commit e2de49d9a1
2 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
utils/TableGen/DAGISelEmitter.cpp
View File

@ -561,7 +561,6 @@ void PatternCodeEmitter::EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
unsigned OpNo = 0; unsigned OpNo = 0;
bool NodeHasChain = N->NodeHasProperty(SDNPHasChain, CGP); bool NodeHasChain = N->NodeHasProperty(SDNPHasChain, CGP);
bool HasChain = N->TreeHasProperty(SDNPHasChain, CGP); bool HasChain = N->TreeHasProperty(SDNPHasChain, CGP);
bool EmittedUseCheck = false;
if (HasChain) { if (HasChain) {
if (NodeHasChain) if (NodeHasChain)
OpNo = 1; OpNo = 1;
@ -571,7 +570,6 @@ void PatternCodeEmitter::EmitMatchCode(TreePatternNode *N, TreePatternNode *P,
std::string ParentName(RootName.begin(), RootName.end()-1); std::string ParentName(RootName.begin(), RootName.end()-1);
emitCheck("IsProfitableToFold(" + getValueName(RootName) + emitCheck("IsProfitableToFold(" + getValueName(RootName) +
", " + getNodeName(ParentName) + ", N)"); ", " + getNodeName(ParentName) + ", N)");
EmittedUseCheck = true;
if (NodeHasChain) { if (NodeHasChain) {
// If the immediate use can somehow reach this node through another // If the immediate use can somehow reach this node through another
// path, then can't fold it either or it will create a cycle. // path, then can't fold it either or it will create a cycle.

2
utils/TableGen/DAGISelMatcherGen.cpp
View File

@ -243,8 +243,6 @@ void MatcherGen::EmitOperatorMatchCode(const TreePatternNode *N,
} }
} }
// FIXME: Handle EmittedUseCheck & Flags & .hasOneUse()
for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) { for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i, ++OpNo) {
// Get the code suitable for matching this child. Move to the child, check // Get the code suitable for matching this child. Move to the child, check
// it then move back to the parent. // it then move back to the parent.