1 //===- IntervalPartition.cpp - Interval Partition module code ----*- C++ -*--=//
3 // This file contains the definition of the cfg::IntervalPartition class, which
4 // calculates and represent the interval partition of a method.
6 //===----------------------------------------------------------------------===//
8 #include "llvm/Analysis/IntervalIterator.h"
9 #include "llvm/Tools/STLExtras.h"
13 //===----------------------------------------------------------------------===//
14 // IntervalPartition Implementation
15 //===----------------------------------------------------------------------===//
17 // Destructor - Free memory
18 IntervalPartition::~IntervalPartition() {
19 for_each(begin(), end(), deleter<cfg::Interval>);
22 // addIntervalToPartition - Add an interval to the internal list of intervals,
23 // and then add mappings from all of the basic blocks in the interval to the
24 // interval itself (in the IntervalMap).
26 void IntervalPartition::addIntervalToPartition(Interval *I) {
27 IntervalList.push_back(I);
29 // Add mappings for all of the basic blocks in I to the IntervalPartition
30 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
32 IntervalMap.insert(make_pair(*It, I));
35 // updatePredecessors - Interval generation only sets the successor fields of
36 // the interval data structures. After interval generation is complete,
37 // run through all of the intervals and propogate successor info as
40 void IntervalPartition::updatePredecessors(cfg::Interval *Int) {
41 BasicBlock *Header = Int->getHeaderNode();
42 for (Interval::succ_iterator I = Int->Successors.begin(),
43 E = Int->Successors.end(); I != E; ++I)
44 getBlockInterval(*I)->Predecessors.push_back(Header);
47 // IntervalPartition ctor - Build the first level interval partition for the
48 // specified method...
50 IntervalPartition::IntervalPartition(Method *M) {
51 assert(M->front() && "Cannot operate on prototypes!");
53 // Pass false to intervals_begin because we take ownership of it's memory
54 method_interval_iterator I = intervals_begin(M, false);
55 assert(I != intervals_end(M) && "No intervals in method!?!?!");
57 addIntervalToPartition(RootInterval = *I);
59 ++I; // After the first one...
61 // Add the rest of the intervals to the partition...
62 for_each(I, intervals_end(M),
63 bind_obj(this, &IntervalPartition::addIntervalToPartition));
65 // Now that we know all of the successor information, propogate this to the
66 // predecessors for each block...
67 for_each(begin(), end(),
68 bind_obj(this, &IntervalPartition::updatePredecessors));
72 // IntervalPartition ctor - Build a reduced interval partition from an
73 // existing interval graph. This takes an additional boolean parameter to
74 // distinguish it from a copy constructor. Always pass in false for now.
76 IntervalPartition::IntervalPartition(IntervalPartition &IP, bool) {
77 Interval *MethodStart = IP.getRootInterval();
78 assert(MethodStart && "Cannot operate on empty IntervalPartitions!");
80 // Pass false to intervals_begin because we take ownership of it's memory
81 interval_part_interval_iterator I = intervals_begin(IP, false);
82 assert(I != intervals_end(IP) && "No intervals in interval partition!?!?!");
84 addIntervalToPartition(RootInterval = *I);
86 ++I; // After the first one...
88 // Add the rest of the intervals to the partition...
89 for_each(I, intervals_end(IP),
90 bind_obj(this, &IntervalPartition::addIntervalToPartition));
92 // Now that we know all of the successor information, propogate this to the
93 // predecessors for each block...
94 for_each(begin(), end(),
95 bind_obj(this, &IntervalPartition::updatePredecessors));