// 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(begin(), end(),
+ 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();
// Now that we know all of the successor information, propogate this to the
// predecessors for each block...
- for_each(begin(), end(),
+ for_each(Intervals.begin(), Intervals.end(),
bind_obj(this, &IntervalPartition::updatePredecessors));
return false;
}
// Now that we know all of the successor information, propogate this to the
// predecessors for each block...
- for_each(begin(), end(),
+ for_each(Intervals.begin(), Intervals.end(),
bind_obj(this, &IntervalPartition::updatePredecessors));
}