Prepare for split between Interval, IntervalIterator, and IntervalIPartition

llvm-svn: 60

1 files changed, 2 insertions, 2 deletions

diff --git a/llvm/lib/Analysis/Interval.cpp b/llvm/lib/Analysis/Interval.cpp
index 69935dba632..afa550db72e 100644
--- a/llvm/lib/Analysis/Interval.cpp
+++ b/llvm/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