[llvm-commits] [llvm] r96333 - in /llvm/trunk/utils/TableGen: DAGISelEmitter.cpp DAGISelMatcherGen.cpp

[Chris Lattner]

Author: lattner
Date: Tue Feb 16 00:15:00 2010
New Revision: 96333

URL: http://llvm.org/viewvc/llvm-project?rev=96333&view=rev
Log:
remove now dead code and fixme.

Modified:
    llvm/trunk/utils/TableGen/DAGISelEmitter.cpp
    llvm/trunk/utils/TableGen/DAGISelMatcherGen.cpp

Modified: llvm/trunk/utils/TableGen/DAGISelEmitter.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/DAGISelEmitter.cpp?rev=96333&r1=96332&r2=96333&view=diff

==============================================================================
--- llvm/trunk/utils/TableGen/DAGISelEmitter.cpp (original)
+++ llvm/trunk/utils/TableGen/DAGISelEmitter.cpp Tue Feb 16 00:15:00 2010
@@ -561,7 +561,6 @@
   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 @@
       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.

Modified: llvm/trunk/utils/TableGen/DAGISelMatcherGen.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/DAGISelMatcherGen.cpp?rev=96333&r1=96332&r2=96333&view=diff

==============================================================================
--- llvm/trunk/utils/TableGen/DAGISelMatcherGen.cpp (original)
+++ llvm/trunk/utils/TableGen/DAGISelMatcherGen.cpp Tue Feb 16 00:15:00 2010
@@ -243,8 +243,6 @@
     }
   }
       
-  // 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.