1 //===- LoopInfo.cpp - Natural Loop Calculator -------------------------------=//
3 // This file defines the LoopInfo class that is used to identify natural loops
4 // and determine the loop depth of various nodes of the CFG. Note that the
5 // loops identified may actually be several natural loops that share the same
6 // header node... not just a single natural loop.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Analysis/LoopInfo.h"
11 #include "llvm/Analysis/Dominators.h"
12 #include "llvm/Support/CFG.h"
13 #include "llvm/Assembly/Writer.h"
14 #include "Support/DepthFirstIterator.h"
17 static RegisterAnalysis<LoopInfo>
18 X("loops", "Natural Loop Construction", true);
20 //===----------------------------------------------------------------------===//
21 // Loop implementation
23 bool Loop::contains(const BasicBlock *BB) const {
24 return find(Blocks.begin(), Blocks.end(), BB) != Blocks.end();
27 bool Loop::isLoopExit(const BasicBlock *BB) const {
28 for (BasicBlock::succ_const_iterator SI = succ_begin(BB), SE = succ_end(BB);
36 unsigned Loop::getNumBackEdges() const {
37 unsigned numBackEdges = 0;
38 BasicBlock *header = Blocks.front();
40 for (std::vector<BasicBlock*>::const_iterator I = Blocks.begin(),
41 E = Blocks.end(); I != E; ++I) {
42 for (BasicBlock::succ_iterator SI = succ_begin(*I), SE = succ_end(*I);
50 void Loop::print(std::ostream &OS) const {
51 OS << std::string(getLoopDepth()*2, ' ') << "Loop Containing: ";
53 for (unsigned i = 0; i < getBlocks().size(); ++i) {
55 WriteAsOperand(OS, (const Value*)getBlocks()[i]);
59 for (unsigned i = 0, e = getSubLoops().size(); i != e; ++i)
60 getSubLoops()[i]->print(OS);
64 //===----------------------------------------------------------------------===//
65 // LoopInfo implementation
67 void LoopInfo::stub() {}
69 bool LoopInfo::runOnFunction(Function &) {
71 Calculate(getAnalysis<DominatorSet>()); // Update
75 void LoopInfo::releaseMemory() {
76 for (std::vector<Loop*>::iterator I = TopLevelLoops.begin(),
77 E = TopLevelLoops.end(); I != E; ++I)
78 delete *I; // Delete all of the loops...
80 BBMap.clear(); // Reset internal state of analysis
81 TopLevelLoops.clear();
85 void LoopInfo::Calculate(const DominatorSet &DS) {
86 BasicBlock *RootNode = DS.getRoot();
88 for (df_iterator<BasicBlock*> NI = df_begin(RootNode),
89 NE = df_end(RootNode); NI != NE; ++NI)
90 if (Loop *L = ConsiderForLoop(*NI, DS))
91 TopLevelLoops.push_back(L);
93 for (unsigned i = 0; i < TopLevelLoops.size(); ++i)
94 TopLevelLoops[i]->setLoopDepth(1);
97 void LoopInfo::getAnalysisUsage(AnalysisUsage &AU) const {
99 AU.addRequired<DominatorSet>();
102 void LoopInfo::print(std::ostream &OS) const {
103 for (unsigned i = 0; i < TopLevelLoops.size(); ++i)
104 TopLevelLoops[i]->print(OS);
106 for (std::map<BasicBlock*, Loop*>::const_iterator I = BBMap.begin(),
107 E = BBMap.end(); I != E; ++I)
108 OS << "BB '" << I->first->getName() << "' level = "
109 << I->second->LoopDepth << "\n";
113 Loop *LoopInfo::ConsiderForLoop(BasicBlock *BB, const DominatorSet &DS) {
114 if (BBMap.find(BB) != BBMap.end()) return 0; // Haven't processed this node?
116 std::vector<BasicBlock *> TodoStack;
118 // Scan the predecessors of BB, checking to see if BB dominates any of
120 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I)
121 if (DS.dominates(BB, *I)) // If BB dominates it's predecessor...
122 TodoStack.push_back(*I);
124 if (TodoStack.empty()) return 0; // Doesn't dominate any predecessors...
126 // Create a new loop to represent this basic block...
127 Loop *L = new Loop(BB);
130 while (!TodoStack.empty()) { // Process all the nodes in the loop
131 BasicBlock *X = TodoStack.back();
132 TodoStack.pop_back();
134 if (!L->contains(X)) { // As of yet unprocessed??
135 L->Blocks.push_back(X);
137 // Add all of the predecessors of X to the end of the work stack...
138 TodoStack.insert(TodoStack.end(), pred_begin(X), pred_end(X));
142 // If there are any loops nested within this loop, create them now!
143 for (std::vector<BasicBlock*>::iterator I = L->Blocks.begin(),
144 E = L->Blocks.end(); I != E; ++I)
145 if (Loop *NewLoop = ConsiderForLoop(*I, DS)) {
146 L->SubLoops.push_back(NewLoop);
147 NewLoop->ParentLoop = L;
151 // Add the basic blocks that comprise this loop to the BBMap so that this
152 // loop can be found for them.
154 for (std::vector<BasicBlock*>::iterator I = L->Blocks.begin(),
155 E = L->Blocks.end(); I != E; ++I) {
156 std::map<BasicBlock*, Loop*>::iterator BBMI = BBMap.lower_bound(*I);
157 if (BBMI == BBMap.end() || BBMI->first != *I) // Not in map yet...
158 BBMap.insert(BBMI, std::make_pair(*I, L)); // Must be at this level
164 /// getLoopPreheader - If there is a preheader for this loop, return it. A
165 /// loop has a preheader if there is only one edge to the header of the loop
166 /// from outside of the loop. If this is the case, the block branching to the
167 /// header of the loop is the preheader node. The "preheaders" pass can be
168 /// "Required" to ensure that there is always a preheader node for every loop.
170 /// This method returns null if there is no preheader for the loop (either
171 /// because the loop is dead or because multiple blocks branch to the header
172 /// node of this loop).
174 BasicBlock *Loop::getLoopPreheader() const {
175 // Keep track of nodes outside the loop branching to the header...
178 // Loop over the predecessors of the header node...
179 BasicBlock *Header = getHeader();
180 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header);
182 if (!contains(*PI)) { // If the block is not in the loop...
183 if (Out && Out != *PI)
184 return 0; // Multiple predecessors outside the loop
188 // If there is exactly one preheader, return it. If there was zero, then Out
193 /// addBasicBlockToLoop - This function is used by other analyses to update loop
194 /// information. NewBB is set to be a new member of the current loop. Because
195 /// of this, it is added as a member of all parent loops, and is added to the
196 /// specified LoopInfo object as being in the current basic block. It is not
197 /// valid to replace the loop header with this method.
199 void Loop::addBasicBlockToLoop(BasicBlock *NewBB, LoopInfo &LI) {
200 assert(LI[getHeader()] == this && "Incorrect LI specified for this loop!");
201 assert(NewBB && "Cannot add a null basic block to the loop!");
202 assert(LI[NewBB] == 0 && "BasicBlock already in the loop!");
204 // Add the loop mapping to the LoopInfo object...
205 LI.BBMap[NewBB] = this;
207 // Add the basic block to this loop and all parent loops...
210 L->Blocks.push_back(NewBB);
211 L = L->getParentLoop();