1 //===- IntervalIterator.h - Interval Iterator Declaration --------*- C++ -*--=//
3 // This file defines an iterator that enumerates the intervals in a control flow
4 // graph of some sort. This iterator is parametric, allowing iterator over the
5 // following types of graphs:
7 // 1. A Function* object, composed of BasicBlock nodes.
8 // 2. An IntervalPartition& object, composed of Interval nodes.
10 // This iterator is defined to walk the control flow graph, returning intervals
11 // in depth first order. These intervals are completely filled in except for
12 // the predecessor fields (the successor information is filled in however).
14 // By default, the intervals created by this iterator are deleted after they
15 // are no longer any use to the iterator. This behavior can be changed by
16 // passing a false value into the intervals_begin() function. This causes the
17 // IOwnMem member to be set, and the intervals to not be deleted.
19 // It is only safe to use this if all of the intervals are deleted by the caller
20 // and all of the intervals are processed. However, the user of the iterator is
21 // not allowed to modify or delete the intervals until after the iterator has
22 // been used completely. The IntervalPartition class uses this functionality.
24 //===----------------------------------------------------------------------===//
26 #ifndef LLVM_INTERVAL_ITERATOR_H
27 #define LLVM_INTERVAL_ITERATOR_H
29 #include "llvm/Analysis/IntervalPartition.h"
30 #include "llvm/Function.h"
31 #include "llvm/BasicBlock.h"
32 #include "llvm/Support/CFG.h"
37 // getNodeHeader - Given a source graph node and the source graph, return the
38 // BasicBlock that is the header node. This is the opposite of
39 // getSourceGraphNode.
41 inline BasicBlock *getNodeHeader(BasicBlock *BB) { return BB; }
42 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
44 // getSourceGraphNode - Given a BasicBlock and the source graph, return the
45 // source graph node that corresponds to the BasicBlock. This is the opposite
48 inline BasicBlock *getSourceGraphNode(Function *, BasicBlock *BB) {
51 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
52 return IP->getBlockInterval(BB);
55 // addNodeToInterval - This method exists to assist the generic ProcessNode
56 // with the task of adding a node to the new interval, depending on the
57 // type of the source node. In the case of a CFG source graph (BasicBlock
58 // case), the BasicBlock itself is added to the interval.
60 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
61 Int->Nodes.push_back(BB);
64 // addNodeToInterval - This method exists to assist the generic ProcessNode
65 // with the task of adding a node to the new interval, depending on the
66 // type of the source node. In the case of a CFG source graph (BasicBlock
67 // case), the BasicBlock itself is added to the interval. In the case of
68 // an IntervalPartition source graph (Interval case), all of the member
69 // BasicBlocks are added to the interval.
71 inline void addNodeToInterval(Interval *Int, Interval *I) {
72 // Add all of the nodes in I as new nodes in Int.
73 copy(I->Nodes.begin(), I->Nodes.end(), back_inserter(Int->Nodes));
80 template<class NodeTy, class OrigContainer_t>
81 class IntervalIterator {
82 std::stack<std::pair<Interval*, typename Interval::succ_iterator> > IntStack;
83 std::set<BasicBlock*> Visited;
84 OrigContainer_t *OrigContainer;
85 bool IOwnMem; // If True, delete intervals when done with them
86 // See file header for conditions of use
88 typedef BasicBlock* _BB;
90 typedef IntervalIterator<NodeTy, OrigContainer_t> _Self;
91 typedef std::forward_iterator_tag iterator_category;
93 IntervalIterator() {} // End iterator, empty stack
94 IntervalIterator(Function *M, bool OwnMemory) : IOwnMem(OwnMemory) {
96 if (!ProcessInterval(&M->front())) {
97 assert(0 && "ProcessInterval should never fail for first interval!");
101 IntervalIterator(IntervalPartition &IP, bool OwnMemory) : IOwnMem(OwnMemory) {
103 if (!ProcessInterval(IP.getRootInterval())) {
104 assert(0 && "ProcessInterval should never fail for first interval!");
108 inline ~IntervalIterator() {
110 while (!IntStack.empty()) {
116 inline bool operator==(const _Self& x) const { return IntStack == x.IntStack;}
117 inline bool operator!=(const _Self& x) const { return !operator==(x); }
119 inline const Interval *operator*() const { return IntStack.top().first; }
120 inline Interval *operator*() { return IntStack.top().first; }
121 inline const Interval *operator->() const { return operator*(); }
122 inline Interval *operator->() { return operator*(); }
124 _Self& operator++() { // Preincrement
125 assert(!IntStack.empty() && "Attempting to use interval iterator at end!");
127 // All of the intervals on the stack have been visited. Try visiting
128 // their successors now.
129 Interval::succ_iterator &SuccIt = IntStack.top().second,
130 EndIt = succ_end(IntStack.top().first);
131 while (SuccIt != EndIt) { // Loop over all interval succs
132 bool Done = ProcessInterval(getSourceGraphNode(OrigContainer, *SuccIt));
133 ++SuccIt; // Increment iterator
134 if (Done) return *this; // Found a new interval! Use it!
137 // Free interval memory... if neccesary
138 if (IOwnMem) delete IntStack.top().first;
140 // We ran out of successors for this interval... pop off the stack
142 } while (!IntStack.empty());
146 inline _Self operator++(int) { // Postincrement
147 _Self tmp = *this; ++*this; return tmp;
151 // ProcessInterval - This method is used during the construction of the
152 // interval graph. It walks through the source graph, recursively creating
153 // an interval per invokation until the entire graph is covered. This uses
154 // the ProcessNode method to add all of the nodes to the interval.
156 // This method is templated because it may operate on two different source
157 // graphs: a basic block graph, or a preexisting interval graph.
159 bool ProcessInterval(NodeTy *Node) {
160 BasicBlock *Header = getNodeHeader(Node);
161 if (Visited.count(Header)) return false;
163 Interval *Int = new Interval(Header);
164 Visited.insert(Header); // The header has now been visited!
166 // Check all of our successors to see if they are in the interval...
167 for (typename NodeTy::succ_iterator I = succ_begin(Node),
168 E = succ_end(Node); I != E; ++I)
169 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
171 IntStack.push(make_pair(Int, succ_begin(Int)));
175 // ProcessNode - This method is called by ProcessInterval to add nodes to the
176 // interval being constructed, and it is also called recursively as it walks
177 // the source graph. A node is added to the current interval only if all of
178 // its predecessors are already in the graph. This also takes care of keeping
179 // the successor set of an interval up to date.
181 // This method is templated because it may operate on two different source
182 // graphs: a basic block graph, or a preexisting interval graph.
184 void ProcessNode(Interval *Int, NodeTy *Node) {
185 assert(Int && "Null interval == bad!");
186 assert(Node && "Null Node == bad!");
188 BasicBlock *NodeHeader = getNodeHeader(Node);
190 if (Visited.count(NodeHeader)) { // Node already been visited?
191 if (Int->contains(NodeHeader)) { // Already in this interval...
193 } else { // In other interval, add as successor
194 if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set
195 Int->Successors.push_back(NodeHeader);
197 } else { // Otherwise, not in interval yet
198 for (typename NodeTy::pred_iterator I = pred_begin(Node),
199 E = pred_end(Node); I != E; ++I) {
200 if (!Int->contains(*I)) { // If pred not in interval, we can't be
201 if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set
202 Int->Successors.push_back(NodeHeader);
203 return; // See you later
207 // If we get here, then all of the predecessors of BB are in the interval
208 // already. In this case, we must add BB to the interval!
209 addNodeToInterval(Int, Node);
210 Visited.insert(NodeHeader); // The node has now been visited!
212 if (Int->isSuccessor(NodeHeader)) {
213 // If we were in the successor list from before... remove from succ list
214 Int->Successors.erase(remove(Int->Successors.begin(),
215 Int->Successors.end(), NodeHeader),
216 Int->Successors.end());
219 // Now that we have discovered that Node is in the interval, perhaps some
220 // of its successors are as well?
221 for (typename NodeTy::succ_iterator It = succ_begin(Node),
222 End = succ_end(Node); It != End; ++It)
223 ProcessNode(Int, getSourceGraphNode(OrigContainer, *It));
228 typedef IntervalIterator<BasicBlock, Function> function_interval_iterator;
229 typedef IntervalIterator<Interval, IntervalPartition> interval_part_interval_iterator;
232 inline function_interval_iterator intervals_begin(Function *F,
233 bool DeleteInts = true) {
234 return function_interval_iterator(F, DeleteInts);
236 inline function_interval_iterator intervals_end(Function *) {
237 return function_interval_iterator();
240 inline interval_part_interval_iterator
241 intervals_begin(IntervalPartition &IP, bool DeleteIntervals = true) {
242 return interval_part_interval_iterator(IP, DeleteIntervals);
245 inline interval_part_interval_iterator intervals_end(IntervalPartition &IP) {
246 return interval_part_interval_iterator();