Lines Matching refs:Interval
1 //===- IntervalPartition.cpp - Interval Partition module code -------------===//
11 // calculates and represent the interval partition of a function.
20 "Interval Partition Construction", true, true)
40 // addIntervalToPartition - Add an interval to the internal list of intervals,
41 // and then add mappings from all of the basic blocks in the interval to the
42 // interval itself (in the IntervalMap).
44 void IntervalPartition::addIntervalToPartition(Interval *I) {
48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
53 // updatePredecessors - Interval generation only sets the successor fields of
54 // the interval data structures. After interval generation is complete,
58 void IntervalPartition::updatePredecessors(Interval *Int) {
60 for (Interval::succ_iterator I = Int->Successors.begin(),
65 // IntervalPartition ctor - Build the first level interval partition for the
89 // IntervalPartition ctor - Build a reduced interval partition from an
90 // existing interval graph. This takes an additional boolean parameter to
99 assert(I != intervals_end(IP) && "No intervals in interval partition!?!?!");
