1 //===- IntervalPartition.cpp - Interval Partition module code -------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains the definition of the IntervalPartition class, which
11 // calculates and represent the interval partition of a function.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Analysis/IntervalIterator.h"
16 #include "llvm/ADT/STLExtras.h"
20 static RegisterAnalysis<IntervalPartition>
21 X("intervals", "Interval Partition Construction", true);
23 //===----------------------------------------------------------------------===//
24 // IntervalPartition Implementation
25 //===----------------------------------------------------------------------===//
27 // destroy - Reset state back to before function was analyzed
28 void IntervalPartition::destroy() {
29 for_each(Intervals.begin(), Intervals.end(), deleter<Interval>);
34 void IntervalPartition::print(std::ostream &O) const {
35 std::copy(Intervals.begin(), Intervals.end(),
36 std::ostream_iterator<const Interval *>(O, "\n"));
39 // addIntervalToPartition - Add an interval to the internal list of intervals,
40 // and then add mappings from all of the basic blocks in the interval to the
41 // interval itself (in the IntervalMap).
43 void IntervalPartition::addIntervalToPartition(Interval *I) {
44 Intervals.push_back(I);
46 // Add mappings for all of the basic blocks in I to the IntervalPartition
47 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
49 IntervalMap.insert(std::make_pair(*It, I));
52 // updatePredecessors - Interval generation only sets the successor fields of
53 // the interval data structures. After interval generation is complete,
54 // run through all of the intervals and propagate successor info as
57 void IntervalPartition::updatePredecessors(Interval *Int) {
58 BasicBlock *Header = Int->getHeaderNode();
59 for (Interval::succ_iterator I = Int->Successors.begin(),
60 E = Int->Successors.end(); I != E; ++I)
61 getBlockInterval(*I)->Predecessors.push_back(Header);
64 // IntervalPartition ctor - Build the first level interval partition for the
65 // specified function...
67 bool IntervalPartition::runOnFunction(Function &F) {
68 // Pass false to intervals_begin because we take ownership of it's memory
69 function_interval_iterator I = intervals_begin(&F, false);
70 assert(I != intervals_end(&F) && "No intervals in function!?!?!");
72 addIntervalToPartition(RootInterval = *I);
74 ++I; // After the first one...
76 // Add the rest of the intervals to the partition...
77 for_each(I, intervals_end(&F),
78 bind_obj(this, &IntervalPartition::addIntervalToPartition));
80 // Now that we know all of the successor information, propagate this to the
81 // predecessors for each block...
82 for_each(Intervals.begin(), Intervals.end(),
83 bind_obj(this, &IntervalPartition::updatePredecessors));
88 // IntervalPartition ctor - Build a reduced interval partition from an
89 // existing interval graph. This takes an additional boolean parameter to
90 // distinguish it from a copy constructor. Always pass in false for now.
92 IntervalPartition::IntervalPartition(IntervalPartition &IP, bool) {
93 Interval *FunctionStart = IP.getRootInterval();
94 assert(FunctionStart && "Cannot operate on empty IntervalPartitions!");
96 // Pass false to intervals_begin because we take ownership of it's memory
97 interval_part_interval_iterator I = intervals_begin(IP, false);
98 assert(I != intervals_end(IP) && "No intervals in interval partition!?!?!");
100 addIntervalToPartition(RootInterval = *I);
102 ++I; // After the first one...
104 // Add the rest of the intervals to the partition...
105 for_each(I, intervals_end(IP),
106 bind_obj(this, &IntervalPartition::addIntervalToPartition));
108 // Now that we know all of the successor information, propagate this to the
109 // predecessors for each block...
110 for_each(Intervals.begin(), Intervals.end(),
111 bind_obj(this, &IntervalPartition::updatePredecessors));
114 } // End llvm namespace