From e2de49d9a1f26a16963739eab94aeba894df16a7 Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Tue, 16 Feb 2010 06:15:00 +0000
Subject: [PATCH] remove now dead code and fixme.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@96333 91177308-0d34-0410-b5e6-96231b3b80d8
---
 utils/TableGen/DAGISelEmitter.cpp    | 2 --
 utils/TableGen/DAGISelMatcherGen.cpp | 2 --
 2 files changed, 4 deletions(-)

diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp
index 8b7b74c7ad7..639c148781a 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 3ed076c7c7e..07ab4729a6b 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.