Teach BasicAA about noalias parameter attributes, but do it correctly this time.

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

diff --git a/lib/Analysis/IntervalPartition.cpp b/lib/Analysis/IntervalPartition.cpp
index eb2c06cc64c427f91123e3a38ae12127fe0f2f92..e3396916caef9c7a1fbf048c8087e31fa7ec69b3 100644 (file)
--- a/lib/Analysis/IntervalPartition.cpp
+++ b/lib/Analysis/IntervalPartition.cpp
@@ -1,10 +1,10 @@
 //===- IntervalPartition.cpp - Interval Partition module code -------------===//
-// 
+//
 //                     The LLVM Compiler Infrastructure
 //
 // 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
@@ -13,12 +13,10 @@
 //===----------------------------------------------------------------------===//
 
 #include "llvm/Analysis/IntervalIterator.h"
-#include "llvm/ADT/STLExtras.h"
-#include <algorithm>
-
-namespace llvm {
+using namespace llvm;
 
-static RegisterAnalysis<IntervalPartition>
+char IntervalPartition::ID = 0;
+static RegisterPass<IntervalPartition>
 X("intervals", "Interval Partition Construction", true);
 
 //===----------------------------------------------------------------------===//
@@ -27,14 +25,15 @@ X("intervals", "Interval Partition Construction", true);
 
 // destroy - Reset state back to before function was analyzed
 void IntervalPartition::destroy() {
-  std::for_each(Intervals.begin(), Intervals.end(), deleter<Interval>);
+  for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
+    delete Intervals[i];
   IntervalMap.clear();
   RootInterval = 0;
 }
 
 void IntervalPartition::print(std::ostream &O, const Module*) const {
-  std::copy(Intervals.begin(), Intervals.end(),
-            std::ostream_iterator<const Interval *>(O, "\n"));
+  for(unsigned i = 0, e = Intervals.size(); i != e; ++i)
+    Intervals[i]->print(O);
 }
 
 // addIntervalToPartition - Add an interval to the internal list of intervals,
@@ -57,8 +56,8 @@ void IntervalPartition::addIntervalToPartition(Interval *I) {
 //
 void IntervalPartition::updatePredecessors(Interval *Int) {
   BasicBlock *Header = Int->getHeaderNode();
-  for (Interval::succ_iterator I = Int->Successors.begin(), 
-                              E = Int->Successors.end(); I != E; ++I)
+  for (Interval::succ_iterator I = Int->Successors.begin(),
+         E = Int->Successors.end(); I != E; ++I)
     getBlockInterval(*I)->Predecessors.push_back(Header);
 }
 
@@ -74,14 +73,14 @@ bool IntervalPartition::runOnFunction(Function &F) {
 
   ++I;  // After the first one...
 
-  // Add the rest of the intervals to the partition...
-  for_each(I, intervals_end(&F),
-          bind_obj(this, &IntervalPartition::addIntervalToPartition));
+  // Add the rest of the intervals to the partition.
+  for (function_interval_iterator E = intervals_end(&F); I != E; ++I)
+    addIntervalToPartition(*I);
 
   // Now that we know all of the successor information, propagate this to the
-  // predecessors for each block...
-  for_each(Intervals.begin(), Intervals.end(), 
-          bind_obj(this, &IntervalPartition::updatePredecessors));
+  // predecessors for each block.
+  for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
+    updatePredecessors(Intervals[i]);
   return false;
 }
 
@@ -90,7 +89,8 @@ bool IntervalPartition::runOnFunction(Function &F) {
 // existing interval graph.  This takes an additional boolean parameter to
 // distinguish it from a copy constructor.  Always pass in false for now.
 //
-IntervalPartition::IntervalPartition(IntervalPartition &IP, bool) {
+IntervalPartition::IntervalPartition(IntervalPartition &IP, bool)
+  : FunctionPass((intptr_t) &ID) {
   Interval *FunctionStart = IP.getRootInterval();
   assert(FunctionStart && "Cannot operate on empty IntervalPartitions!");
 
@@ -102,14 +102,13 @@ IntervalPartition::IntervalPartition(IntervalPartition &IP, bool) {
 
   ++I;  // After the first one...
 
-  // Add the rest of the intervals to the partition...
-  for_each(I, intervals_end(IP),
-          bind_obj(this, &IntervalPartition::addIntervalToPartition));
+  // Add the rest of the intervals to the partition.
+  for (interval_part_interval_iterator E = intervals_end(IP); I != E; ++I)
+    addIntervalToPartition(*I);
 
   // Now that we know all of the successor information, propagate this to the
-  // predecessors for each block...
-  for_each(Intervals.begin(), Intervals.end(), 
-          bind_obj(this, &IntervalPartition::updatePredecessors));
+  // predecessors for each block.
+  for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
+    updatePredecessors(Intervals[i]);
 }
 
-} // End llvm namespace