1 //===-- LCSSA.cpp - Convert loops into loop-closed SSA form ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass transforms loops by placing phi nodes at the end of the loops for
11 // all values that are live across the loop boundary. For example, it turns
12 // the left into the right code:
14 // for (...) for (...)
19 // X3 = phi(X1, X2) X3 = phi(X1, X2)
20 // ... = X3 + 4 X4 = phi(X3)
23 // This is still valid LLVM; the extra phi nodes are purely redundant, and will
24 // be trivially eliminated by InstCombine. The major benefit of this
25 // transformation is that it makes many other loop optimizations, such as
26 // LoopUnswitching, simpler.
28 //===----------------------------------------------------------------------===//
30 #define DEBUG_TYPE "lcssa"
31 #include "llvm/Transforms/Scalar.h"
32 #include "llvm/Constants.h"
33 #include "llvm/Pass.h"
34 #include "llvm/Function.h"
35 #include "llvm/Instructions.h"
36 #include "llvm/Analysis/Dominators.h"
37 #include "llvm/Analysis/LoopPass.h"
38 #include "llvm/Analysis/ScalarEvolution.h"
39 #include "llvm/Transforms/Utils/SSAUpdater.h"
40 #include "llvm/ADT/Statistic.h"
41 #include "llvm/ADT/STLExtras.h"
42 #include "llvm/Support/PredIteratorCache.h"
45 STATISTIC(NumLCSSA, "Number of live out of a loop variables");
48 struct LCSSA : public LoopPass {
49 static char ID; // Pass identification, replacement for typeid
50 LCSSA() : LoopPass(&ID) {}
52 // Cached analysis information for the current function.
54 std::vector<BasicBlock*> LoopBlocks;
55 PredIteratorCache PredCache;
58 virtual bool runOnLoop(Loop *L, LPPassManager &LPM);
60 /// This transformation requires natural loop information & requires that
61 /// loop preheaders be inserted into the CFG. It maintains both of these,
62 /// as well as the CFG. It also requires dominator information.
64 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
67 // LCSSA doesn't actually require LoopSimplify, but the PassManager
68 // doesn't know how to schedule LoopSimplify by itself.
69 AU.addRequiredID(LoopSimplifyID);
70 AU.addPreservedID(LoopSimplifyID);
71 AU.addRequiredTransitive<LoopInfo>();
72 AU.addPreserved<LoopInfo>();
73 AU.addRequiredTransitive<DominatorTree>();
74 AU.addPreserved<ScalarEvolution>();
75 AU.addPreserved<DominatorTree>();
77 // Request DominanceFrontier now, even though LCSSA does
78 // not use it. This allows Pass Manager to schedule Dominance
79 // Frontier early enough such that one LPPassManager can handle
80 // multiple loop transformation passes.
81 AU.addRequired<DominanceFrontier>();
82 AU.addPreserved<DominanceFrontier>();
85 bool ProcessInstruction(Instruction *Inst,
86 const SmallVectorImpl<BasicBlock*> &ExitBlocks);
88 /// verifyAnalysis() - Verify loop nest.
89 virtual void verifyAnalysis() const {
90 // Check the special guarantees that LCSSA makes.
91 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!");
94 /// inLoop - returns true if the given block is within the current loop
95 bool inLoop(BasicBlock *B) const {
96 return std::binary_search(LoopBlocks.begin(), LoopBlocks.end(), B);
102 static RegisterPass<LCSSA> X("lcssa", "Loop-Closed SSA Form Pass");
104 Pass *llvm::createLCSSAPass() { return new LCSSA(); }
105 const PassInfo *const llvm::LCSSAID = &X;
108 /// BlockDominatesAnExit - Return true if the specified block dominates at least
109 /// one of the blocks in the specified list.
110 static bool BlockDominatesAnExit(BasicBlock *BB,
111 const SmallVectorImpl<BasicBlock*> &ExitBlocks,
113 DomTreeNode *DomNode = DT->getNode(BB);
114 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
115 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
122 /// runOnFunction - Process all loops in the function, inner-most out.
123 bool LCSSA::runOnLoop(Loop *TheLoop, LPPassManager &LPM) {
126 DT = &getAnalysis<DominatorTree>();
128 // Get the set of exiting blocks.
129 SmallVector<BasicBlock*, 8> ExitBlocks;
130 L->getExitBlocks(ExitBlocks);
132 if (ExitBlocks.empty())
135 // Speed up queries by creating a sorted vector of blocks.
137 LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end());
138 array_pod_sort(LoopBlocks.begin(), LoopBlocks.end());
140 // Look at all the instructions in the loop, checking to see if they have uses
141 // outside the loop. If so, rewrite those uses.
142 bool MadeChange = false;
144 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end();
146 BasicBlock *BB = *BBI;
148 // For large loops, avoid use-scanning by using dominance information: In
149 // particular, if a block does not dominate any of the loop exits, then none
150 // of the values defined in the block could be used outside the loop.
151 if (!BlockDominatesAnExit(BB, ExitBlocks, DT))
154 for (BasicBlock::iterator I = BB->begin(), E = BB->end();
156 // Reject two common cases fast: instructions with no uses (like stores)
157 // and instructions with one use that is in the same block as this.
158 if (I->use_empty() ||
159 (I->hasOneUse() && I->use_back()->getParent() == BB &&
160 !isa<PHINode>(I->use_back())))
163 MadeChange |= ProcessInstruction(I, ExitBlocks);
167 assert(L->isLCSSAForm(*DT));
173 /// isExitBlock - Return true if the specified block is in the list.
174 static bool isExitBlock(BasicBlock *BB,
175 const SmallVectorImpl<BasicBlock*> &ExitBlocks) {
176 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
177 if (ExitBlocks[i] == BB)
182 /// ProcessInstruction - Given an instruction in the loop, check to see if it
183 /// has any uses that are outside the current loop. If so, insert LCSSA PHI
184 /// nodes and rewrite the uses.
185 bool LCSSA::ProcessInstruction(Instruction *Inst,
186 const SmallVectorImpl<BasicBlock*> &ExitBlocks) {
187 SmallVector<Use*, 16> UsesToRewrite;
189 BasicBlock *InstBB = Inst->getParent();
191 for (Value::use_iterator UI = Inst->use_begin(), E = Inst->use_end();
194 BasicBlock *UserBB = cast<Instruction>(U)->getParent();
195 if (PHINode *PN = dyn_cast<PHINode>(U))
196 UserBB = PN->getIncomingBlock(UI);
198 if (InstBB != UserBB && !inLoop(UserBB))
199 UsesToRewrite.push_back(&UI.getUse());
202 // If there are no uses outside the loop, exit with no change.
203 if (UsesToRewrite.empty()) return false;
205 ++NumLCSSA; // We are applying the transformation
207 // Invoke instructions are special in that their result value is not available
208 // along their unwind edge. The code below tests to see whether DomBB dominates
209 // the value, so adjust DomBB to the normal destination block, which is
210 // effectively where the value is first usable.
211 BasicBlock *DomBB = Inst->getParent();
212 if (InvokeInst *Inv = dyn_cast<InvokeInst>(Inst))
213 DomBB = Inv->getNormalDest();
215 DomTreeNode *DomNode = DT->getNode(DomBB);
217 SSAUpdater SSAUpdate;
218 SSAUpdate.Initialize(Inst);
220 // Insert the LCSSA phi's into all of the exit blocks dominated by the
221 // value, and add them to the Phi's map.
222 for (SmallVectorImpl<BasicBlock*>::const_iterator BBI = ExitBlocks.begin(),
223 BBE = ExitBlocks.end(); BBI != BBE; ++BBI) {
224 BasicBlock *ExitBB = *BBI;
225 if (!DT->dominates(DomNode, DT->getNode(ExitBB))) continue;
227 // If we already inserted something for this BB, don't reprocess it.
228 if (SSAUpdate.HasValueForBlock(ExitBB)) continue;
230 PHINode *PN = PHINode::Create(Inst->getType(), Inst->getName()+".lcssa",
232 PN->reserveOperandSpace(PredCache.GetNumPreds(ExitBB));
234 // Add inputs from inside the loop for this PHI.
235 for (BasicBlock **PI = PredCache.GetPreds(ExitBB); *PI; ++PI) {
236 PN->addIncoming(Inst, *PI);
238 // If the exit block has a predecessor not within the loop, arrange for
239 // the incoming value use corresponding to that predecessor to be
240 // rewritten in terms of a different LCSSA PHI.
242 UsesToRewrite.push_back(
244 PN->getOperandNumForIncomingValue(PN->getNumIncomingValues()-1)));
247 // Remember that this phi makes the value alive in this block.
248 SSAUpdate.AddAvailableValue(ExitBB, PN);
251 // Rewrite all uses outside the loop in terms of the new PHIs we just
253 for (unsigned i = 0, e = UsesToRewrite.size(); i != e; ++i) {
254 // If this use is in an exit block, rewrite to use the newly inserted PHI.
255 // This is required for correctness because SSAUpdate doesn't handle uses in
256 // the same block. It assumes the PHI we inserted is at the end of the
258 Instruction *User = cast<Instruction>(UsesToRewrite[i]->getUser());
259 BasicBlock *UserBB = User->getParent();
260 if (PHINode *PN = dyn_cast<PHINode>(User))
261 UserBB = PN->getIncomingBlock(*UsesToRewrite[i]);
263 if (isa<PHINode>(UserBB->begin()) &&
264 isExitBlock(UserBB, ExitBlocks)) {
265 UsesToRewrite[i]->set(UserBB->begin());
269 // Otherwise, do full PHI insertion.
270 SSAUpdate.RewriteUse(*UsesToRewrite[i]);