Prepare for split between Interval, IntervalIterator, and IntervalIPartition

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Analysis/Interval.cpp b/lib/Analysis/Interval.cpp
index 69935dba632d88080db8fa5adf87f9f68dbdffe2..afa550db72e34f4f5c9be8ec57613526adccb8b0 100644 (file)
--- a/lib/Analysis/Interval.cpp
+++ b/lib/Analysis/Interval.cpp
@@ -40,7 +40,7 @@ IntervalPartition::~IntervalPartition() {
   for_each(begin(), end(), deleter<cfg::Interval>);
 }
 
-
+#if 0
 // getNodeHeader - Given a source graph node and the source graph, return the 
 // BasicBlock that is the header node.  This is the opposite of
 // getSourceGraphNode.
@@ -48,7 +48,6 @@ IntervalPartition::~IntervalPartition() {
 inline static BasicBlock *getNodeHeader(BasicBlock *BB) { return BB; }
 inline static BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
 
-
 // getSourceGraphNode - Given a BasicBlock and the source graph, return the 
 // source graph node that corresponds to the BasicBlock.  This is the opposite
 // of getNodeHeader.
@@ -60,6 +59,7 @@ inline static Interval *getSourceGraphNode(IntervalPartition *IP,
                                           BasicBlock *BB) { 
   return IP->getBlockInterval(BB);
 }
+#endif
 
 
 // addNodeToInterval - This method exists to assist the generic ProcessNode