The tarjan iterator now returns a reference to the current SCC, not a possibly null...

[oota-llvm.git] / lib / Analysis / IntervalPartition.cpp

diff --git a/lib/Analysis/IntervalPartition.cpp b/lib/Analysis/IntervalPartition.cpp
index 8d0e34c1a73f5249fe14d40453faf91db75dd57a..9b9010f167e7a304ed844a355c73acdff2b4bb55 100644 (file)
--- a/lib/Analysis/IntervalPartition.cpp
+++ b/lib/Analysis/IntervalPartition.cpp
@@ -10,7 +10,8 @@
 
 using std::make_pair;
 
-AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>(), true);
+static RegisterAnalysis<IntervalPartition>
+X("intervals", "Interval Partition Construction", true);
 
 //===----------------------------------------------------------------------===//
 // IntervalPartition Implementation
@@ -18,17 +19,22 @@ AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>(), true);
 
 // destroy - Reset state back to before function was analyzed
 void IntervalPartition::destroy() {
-  for_each(begin(), end(), deleter<Interval>);
+  for_each(Intervals.begin(), Intervals.end(), deleter<Interval>);
   IntervalMap.clear();
   RootInterval = 0;
 }
 
+void IntervalPartition::print(std::ostream &O) const {
+  std::copy(Intervals.begin(), Intervals.end(),
+            std::ostream_iterator<const Interval *>(O, "\n"));
+}
+
 // addIntervalToPartition - Add an interval to the internal list of intervals,
 // and then add mappings from all of the basic blocks in the interval to the
 // interval itself (in the IntervalMap).
 //
 void IntervalPartition::addIntervalToPartition(Interval *I) {
-  push_back(I);
+  Intervals.push_back(I);
 
   // Add mappings for all of the basic blocks in I to the IntervalPartition
   for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
@@ -38,7 +44,7 @@ void IntervalPartition::addIntervalToPartition(Interval *I) {
 
 // updatePredecessors - Interval generation only sets the successor fields of
 // the interval data structures.  After interval generation is complete,
-// run through all of the intervals and propogate successor info as
+// run through all of the intervals and propagate successor info as
 // predecessor info.
 //
 void IntervalPartition::updatePredecessors(Interval *Int) {
@@ -64,9 +70,9 @@ bool IntervalPartition::runOnFunction(Function &F) {
   for_each(I, intervals_end(&F),
           bind_obj(this, &IntervalPartition::addIntervalToPartition));
 
-  // Now that we know all of the successor information, propogate this to the
+  // Now that we know all of the successor information, propagate this to the
   // predecessors for each block...
-  for_each(begin(), end(), 
+  for_each(Intervals.begin(), Intervals.end(), 
           bind_obj(this, &IntervalPartition::updatePredecessors));
   return false;
 }
@@ -92,8 +98,8 @@ IntervalPartition::IntervalPartition(IntervalPartition &IP, bool) {
   for_each(I, intervals_end(IP),
           bind_obj(this, &IntervalPartition::addIntervalToPartition));
 
-  // Now that we know all of the successor information, propogate this to the
+  // Now that we know all of the successor information, propagate this to the
   // predecessors for each block...
-  for_each(begin(), end(), 
+  for_each(Intervals.begin(), Intervals.end(), 
           bind_obj(this, &IntervalPartition::updatePredecessors));
 }