replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Prepare for split between Interval, IntervalIterator, and IntervalIPartition 

llvm-svn: 60
This commit is contained in:
Chris Lattner 2001-06-24 03:25:01 +00:00
parent 2e2e27a1af
commit 4c16155c36
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
llvm/lib/Analysis/Interval.cpp
View File

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