-//===- IntervalPartition.cpp - Interval Partition module code ----*- C++ -*--=//
+//===- 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
// calculates and represent the interval partition of a function.
#include "llvm/Analysis/IntervalIterator.h"
#include "Support/STLExtras.h"
-using std::make_pair;
-
static RegisterAnalysis<IntervalPartition>
X("intervals", "Interval Partition Construction", true);
-AnalysisID IntervalPartition::ID = X;
-
//===----------------------------------------------------------------------===//
// IntervalPartition Implementation
//===----------------------------------------------------------------------===//
// 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(ostream &O) const {
- std::copy(begin(), end(),
+void IntervalPartition::print(std::ostream &O) const {
+ std::copy(Intervals.begin(), Intervals.end(),
std::ostream_iterator<const Interval *>(O, "\n"));
}
// 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(Interval *Int) {
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;
}
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));
}