diff options
| -rw-r--r-- | utils/TableGen/DAGISelEmitter.cpp | 2 | ||||
| -rw-r--r-- | utils/TableGen/DAGISelMatcherGen.cpp | 2 |
2 files changed, 0 insertions, 4 deletions
diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp index 8b7b74c7ad..639c148781 100644 --- a/utils/TableGen/DAGISelEmitter.cpp +++ b/utils/TableGen/DAGISelEmitter.cpp @@ -561,7 +561,6 @@ void PatternCodeEmitter::EmitMatchCode(TreePatternNode *N, TreePatternNode *P, unsigned OpNo = 0; bool NodeHasChain = N->NodeHasProperty(SDNPHasChain, CGP); bool HasChain = N->TreeHasProperty(SDNPHasChain, CGP); - bool EmittedUseCheck = false; if (HasChain) { if (NodeHasChain) OpNo = 1; @@ -571,7 +570,6 @@ void PatternCodeEmitter::EmitMatchCode(TreePatternNode *N, TreePatternNode *P, std::string ParentName(RootName.begin(), RootName.end()-1); emitCheck("IsProfitableToFold(" + getValueName(RootName) + ", " + getNodeName(ParentName) + ", N)"); - EmittedUseCheck = true; if (NodeHasChain) { // If the immediate use can somehow reach this node through another // path, then can't fold it either or it will create a cycle. diff --git a/utils/TableGen/DAGISelMatcherGen.cpp b/utils/TableGen/DAGISelMatcherGen.cpp index 3ed076c7c7..07ab4729a6 100644 --- a/utils/TableGen/DAGISelMatcherGen.cpp +++ b/utils/TableGen/DAGISelMatcherGen.cpp @@ -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) { // Get the code suitable for matching this child. Move to the child, check // it then move back to the parent. |