//===- 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 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
//===----------------------------------------------------------------------===//
#include "llvm/Analysis/IntervalIterator.h"
-#include "llvm/ADT/STLExtras.h"
-#include <algorithm>
-
-namespace llvm {
+using namespace llvm;
-static RegisterAnalysis<IntervalPartition>
-X("intervals", "Interval Partition Construction", true);
+char IntervalPartition::ID = 0;
+INITIALIZE_PASS(IntervalPartition, "intervals",
+ "Interval Partition Construction", true, true)
//===----------------------------------------------------------------------===//
// IntervalPartition Implementation
//===----------------------------------------------------------------------===//
-// destroy - Reset state back to before function was analyzed
-void IntervalPartition::destroy() {
- std::for_each(Intervals.begin(), Intervals.end(), deleter<Interval>);
+// releaseMemory - Reset state back to before function was analyzed
+void IntervalPartition::releaseMemory() {
+ for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
+ delete Intervals[i];
IntervalMap.clear();
+ Intervals.clear();
RootInterval = 0;
}
-void IntervalPartition::print(std::ostream &O) const {
- std::copy(Intervals.begin(), Intervals.end(),
- std::ostream_iterator<const Interval *>(O, "\n"));
+void IntervalPartition::print(raw_ostream &O, const Module*) const {
+ for(unsigned i = 0, e = Intervals.size(); i != e; ++i)
+ Intervals[i]->print(O);
}
// addIntervalToPartition - Add an interval to the internal list of intervals,
//
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);
}
++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;
}
// 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) {
- Interval *FunctionStart = IP.getRootInterval();
- assert(FunctionStart && "Cannot operate on empty IntervalPartitions!");
+IntervalPartition::IntervalPartition(IntervalPartition &IP, bool)
+ : FunctionPass(ID) {
+ assert(IP.getRootInterval() && "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);
++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