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
This commit is contained in:
Chris Lattner 2001-06-24 03:25:01 +00:00
parent cf1760aff0
commit a0eb461263

View File

@ -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