Added LLVM project notice to the top of every C++ source file.

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

diff --git a/lib/Analysis/IntervalPartition.cpp b/lib/Analysis/IntervalPartition.cpp
index fff8d224e21017c80d0b6787e4efda6150702efb..27299309984124d8e03e604acf56c29afc99c2a2 100644 (file)
--- a/lib/Analysis/IntervalPartition.cpp
+++ b/lib/Analysis/IntervalPartition.cpp
@@ -1,23 +1,37 @@
-//===- IntervalPartition.cpp - Interval Partition module code ----*- C++ -*--=//
+//===- IntervalPartition.cpp - Interval Partition module code -------------===//
+// 
+//                     The LLVM Compiler Infrastructure
 //
-// This file contains the definition of the cfg::IntervalPartition class, which
-// calculates and represent the interval partition of a method.
+// This file was developed by the LLVM research group and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+// 
+//===----------------------------------------------------------------------===//
+//
+// This file contains the definition of the IntervalPartition class, which
+// calculates and represent the interval partition of a function.
 //
 //===----------------------------------------------------------------------===//
 
 #include "llvm/Analysis/IntervalIterator.h"
 #include "Support/STLExtras.h"
 
-using namespace cfg;
-using std::make_pair;
+static RegisterAnalysis<IntervalPartition>
+X("intervals", "Interval Partition Construction", true);
 
 //===----------------------------------------------------------------------===//
 // IntervalPartition Implementation
 //===----------------------------------------------------------------------===//
 
-// Destructor - Free memory
-IntervalPartition::~IntervalPartition() {
-  for_each(begin(), end(), deleter<cfg::Interval>);
+// destroy - Reset state back to before function was analyzed
+void IntervalPartition::destroy() {
+  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,
@@ -25,20 +39,20 @@ IntervalPartition::~IntervalPartition() {
 // 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();
        It != End; ++It)
-    IntervalMap.insert(make_pair(*It, I));
+    IntervalMap.insert(std::make_pair(*It, 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(cfg::Interval *Int) {
+void IntervalPartition::updatePredecessors(Interval *Int) {
   BasicBlock *Header = Int->getHeaderNode();
   for (Interval::succ_iterator I = Int->Successors.begin(), 
                               E = Int->Successors.end(); I != E; ++I)
@@ -46,27 +60,26 @@ void IntervalPartition::updatePredecessors(cfg::Interval *Int) {
 }
 
 // IntervalPartition ctor - Build the first level interval partition for the
-// specified method...
+// specified function...
 //
-IntervalPartition::IntervalPartition(Method *M) {
-  assert(M->front() && "Cannot operate on prototypes!");
-
+bool IntervalPartition::runOnFunction(Function &F) {
   // Pass false to intervals_begin because we take ownership of it's memory
-  method_interval_iterator I = intervals_begin(M, false);
-  assert(I != intervals_end(M) && "No intervals in method!?!?!");
+  function_interval_iterator I = intervals_begin(&F, false);
+  assert(I != intervals_end(&F) && "No intervals in function!?!?!");
 
   addIntervalToPartition(RootInterval = *I);
 
   ++I;  // After the first one...
 
   // Add the rest of the intervals to the partition...
-  for_each(I, intervals_end(M),
+  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;
 }
 
 
@@ -75,8 +88,8 @@ IntervalPartition::IntervalPartition(Method *M) {
 // distinguish it from a copy constructor.  Always pass in false for now.
 //
 IntervalPartition::IntervalPartition(IntervalPartition &IP, bool) {
-  Interval *MethodStart = IP.getRootInterval();
-  assert(MethodStart && "Cannot operate on empty IntervalPartitions!");
+  Interval *FunctionStart = IP.getRootInterval();
+  assert(FunctionStart && "Cannot operate on empty IntervalPartitions!");
 
   // Pass false to intervals_begin because we take ownership of it's memory
   interval_part_interval_iterator I = intervals_begin(IP, false);
@@ -90,8 +103,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));
 }