[llvm-commits] [llvm] r97522 - /llvm/trunk/include/llvm/CodeGen/DAGISelHeader.h

[Chris Lattner]

Author: lattner
Date: Mon Mar  1 17:40:33 2010
New Revision: 97522

URL: http://llvm.org/viewvc/llvm-project?rev=97522&view=rev
Log:
remove some functions that were only used by the
old isel generated code.

Modified:
    llvm/trunk/include/llvm/CodeGen/DAGISelHeader.h

Modified: llvm/trunk/include/llvm/CodeGen/DAGISelHeader.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/CodeGen/DAGISelHeader.h?rev=97522&r1=97521&r2=97522&view=diff
==============================================================================
--- llvm/trunk/include/llvm/CodeGen/DAGISelHeader.h (original)
+++ llvm/trunk/include/llvm/CodeGen/DAGISelHeader.h Mon Mar  1 17:40:33 2010
@@ -26,29 +26,6 @@
 /// node list.
 SelectionDAG::allnodes_iterator ISelPosition;
 
-/// ChainNotReachable - Returns true if Chain does not reach Op.
-static bool ChainNotReachable(SDNode *Chain, SDNode *Op) {
-  if (Chain->getOpcode() == ISD::EntryToken)
-    return true;
-  if (Chain->getOpcode() == ISD::TokenFactor)
-    return false;
-  if (Chain->getNumOperands() > 0) {
-    SDValue C0 = Chain->getOperand(0);
-    if (C0.getValueType() == MVT::Other)
-      return C0.getNode() != Op && ChainNotReachable(C0.getNode(), Op);
-  }
-  return true;
-}
-
-/// IsChainCompatible - Returns true if Chain is Op or Chain does not reach Op.
-/// This is used to ensure that there are no nodes trapped between Chain, which
-/// is the first chain node discovered in a pattern and Op, a later node, that
-/// will not be selected into the pattern.
-static bool IsChainCompatible(SDNode *Chain, SDNode *Op) {
-  return Chain == Op || ChainNotReachable(Chain, Op);
-}
-
-
 /// ISelUpdater - helper class to handle updates of the 
 /// instruciton selection graph.
 class VISIBILITY_HIDDEN ISelUpdater : public SelectionDAG::DAGUpdateListener {
@@ -117,6 +94,7 @@
       continue;
 
     SDNode *ResNode = Select(Node);
+    
     // If node should not be replaced, continue with the next one.
     if (ResNode == Node)
       continue;