1 //===-- LICM.cpp - Loop Invariant Code Motion Pass ------------------------===//
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 performs loop invariant code motion, attempting to remove as much
11 // code from the body of a loop as possible. It does this by either hoisting
12 // code into the preheader block, or by sinking code to the exit blocks if it is
13 // safe. This pass also promotes must-aliased memory locations in the loop to
14 // live in registers, thus hoisting and sinking "invariant" loads and stores.
16 // This pass uses alias analysis for two purposes:
18 // 1. Moving loop invariant loads and calls out of loops. If we can determine
19 // that a load or call inside of a loop never aliases anything stored to,
20 // we can hoist it or sink it like any other instruction.
21 // 2. Scalar Promotion of Memory - If there is a store instruction inside of
22 // the loop, we try to move the store to happen AFTER the loop instead of
23 // inside of the loop. This can only happen if a few conditions are true:
24 // A. The pointer stored through is loop invariant
25 // B. There are no stores or loads in the loop which _may_ alias the
26 // pointer. There are no calls in the loop which mod/ref the pointer.
27 // If these conditions are true, we can promote the loads and stores in the
28 // loop of the pointer to use a temporary alloca'd variable. We then use
29 // the SSAUpdater to construct the appropriate SSA form for the value.
31 //===----------------------------------------------------------------------===//
33 #include "llvm/Transforms/Scalar.h"
34 #include "llvm/ADT/Statistic.h"
35 #include "llvm/Analysis/AliasAnalysis.h"
36 #include "llvm/Analysis/AliasSetTracker.h"
37 #include "llvm/Analysis/ConstantFolding.h"
38 #include "llvm/Analysis/LoopInfo.h"
39 #include "llvm/Analysis/LoopPass.h"
40 #include "llvm/Analysis/ScalarEvolution.h"
41 #include "llvm/Analysis/ValueTracking.h"
42 #include "llvm/IR/CFG.h"
43 #include "llvm/IR/Constants.h"
44 #include "llvm/IR/DataLayout.h"
45 #include "llvm/IR/DerivedTypes.h"
46 #include "llvm/IR/Dominators.h"
47 #include "llvm/IR/Instructions.h"
48 #include "llvm/IR/IntrinsicInst.h"
49 #include "llvm/IR/LLVMContext.h"
50 #include "llvm/IR/Metadata.h"
51 #include "llvm/IR/PredIteratorCache.h"
52 #include "llvm/Support/CommandLine.h"
53 #include "llvm/Support/Debug.h"
54 #include "llvm/Support/raw_ostream.h"
55 #include "llvm/Target/TargetLibraryInfo.h"
56 #include "llvm/Transforms/Utils/Local.h"
57 #include "llvm/Transforms/Utils/LoopUtils.h"
58 #include "llvm/Transforms/Utils/SSAUpdater.h"
62 #define DEBUG_TYPE "licm"
64 STATISTIC(NumSunk , "Number of instructions sunk out of loop");
65 STATISTIC(NumHoisted , "Number of instructions hoisted out of loop");
66 STATISTIC(NumMovedLoads, "Number of load insts hoisted or sunk");
67 STATISTIC(NumMovedCalls, "Number of call insts hoisted or sunk");
68 STATISTIC(NumPromoted , "Number of memory locations promoted to registers");
71 DisablePromotion("disable-licm-promotion", cl::Hidden,
72 cl::desc("Disable memory promotion in LICM pass"));
75 struct LICM : public LoopPass {
76 static char ID; // Pass identification, replacement for typeid
77 LICM() : LoopPass(ID) {
78 initializeLICMPass(*PassRegistry::getPassRegistry());
81 bool runOnLoop(Loop *L, LPPassManager &LPM) override;
83 /// This transformation requires natural loop information & requires that
84 /// loop preheaders be inserted into the CFG...
86 void getAnalysisUsage(AnalysisUsage &AU) const override {
88 AU.addRequired<DominatorTreeWrapperPass>();
89 AU.addRequired<LoopInfo>();
90 AU.addRequiredID(LoopSimplifyID);
91 AU.addPreservedID(LoopSimplifyID);
92 AU.addRequiredID(LCSSAID);
93 AU.addPreservedID(LCSSAID);
94 AU.addRequired<AliasAnalysis>();
95 AU.addPreserved<AliasAnalysis>();
96 AU.addPreserved<ScalarEvolution>();
97 AU.addRequired<TargetLibraryInfo>();
100 using llvm::Pass::doFinalization;
102 bool doFinalization() override {
103 assert(LoopToAliasSetMap.empty() && "Didn't free loop alias sets");
108 AliasAnalysis *AA; // Current AliasAnalysis information
109 LoopInfo *LI; // Current LoopInfo
110 DominatorTree *DT; // Dominator Tree for the current Loop.
112 const DataLayout *DL; // DataLayout for constant folding.
113 TargetLibraryInfo *TLI; // TargetLibraryInfo for constant folding.
115 // State that is updated as we process loops.
116 bool Changed; // Set to true when we change anything.
117 BasicBlock *Preheader; // The preheader block of the current loop...
118 Loop *CurLoop; // The current loop we are working on...
119 AliasSetTracker *CurAST; // AliasSet information for the current loop...
120 bool MayThrow; // The current loop contains an instruction which
121 // may throw, thus preventing code motion of
122 // instructions with side effects.
123 DenseMap<Loop*, AliasSetTracker*> LoopToAliasSetMap;
125 /// cloneBasicBlockAnalysis - Simple Analysis hook. Clone alias set info.
126 void cloneBasicBlockAnalysis(BasicBlock *From, BasicBlock *To,
129 /// deleteAnalysisValue - Simple Analysis hook. Delete value V from alias
131 void deleteAnalysisValue(Value *V, Loop *L) override;
133 /// SinkRegion - Walk the specified region of the CFG (defined by all blocks
134 /// dominated by the specified block, and that are in the current loop) in
135 /// reverse depth first order w.r.t the DominatorTree. This allows us to
136 /// visit uses before definitions, allowing us to sink a loop body in one
137 /// pass without iteration.
139 void SinkRegion(DomTreeNode *N);
141 /// HoistRegion - Walk the specified region of the CFG (defined by all
142 /// blocks dominated by the specified block, and that are in the current
143 /// loop) in depth first order w.r.t the DominatorTree. This allows us to
144 /// visit definitions before uses, allowing us to hoist a loop body in one
145 /// pass without iteration.
147 void HoistRegion(DomTreeNode *N);
149 /// inSubLoop - Little predicate that returns true if the specified basic
150 /// block is in a subloop of the current one, not the current one itself.
152 bool inSubLoop(BasicBlock *BB) {
153 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop");
154 return LI->getLoopFor(BB) != CurLoop;
157 /// sink - When an instruction is found to only be used outside of the loop,
158 /// this function moves it to the exit blocks and patches up SSA form as
161 void sink(Instruction &I);
163 /// hoist - When an instruction is found to only use loop invariant operands
164 /// that is safe to hoist, this instruction is called to do the dirty work.
166 void hoist(Instruction &I);
168 /// isSafeToExecuteUnconditionally - Only sink or hoist an instruction if it
169 /// is not a trapping instruction or if it is a trapping instruction and is
170 /// guaranteed to execute.
172 bool isSafeToExecuteUnconditionally(Instruction &I);
174 /// isGuaranteedToExecute - Check that the instruction is guaranteed to
177 bool isGuaranteedToExecute(Instruction &I);
179 /// pointerInvalidatedByLoop - Return true if the body of this loop may
180 /// store into the memory location pointed to by V.
182 bool pointerInvalidatedByLoop(Value *V, uint64_t Size,
183 const AAMDNodes &AAInfo) {
184 // Check to see if any of the basic blocks in CurLoop invalidate *V.
185 return CurAST->getAliasSetForPointer(V, Size, AAInfo).isMod();
188 bool canSinkOrHoistInst(Instruction &I);
189 bool isNotUsedInLoop(Instruction &I);
191 void PromoteAliasSet(AliasSet &AS,
192 SmallVectorImpl<BasicBlock*> &ExitBlocks,
193 SmallVectorImpl<Instruction*> &InsertPts,
194 PredIteratorCache &PIC);
196 /// \brief Create a copy of the instruction in the exit block and patch up
198 /// PN is a user of I in ExitBlock that can be used to get the number and
199 /// list of predecessors fast.
200 Instruction *CloneInstructionInExitBlock(Instruction &I,
201 BasicBlock &ExitBlock,
207 INITIALIZE_PASS_BEGIN(LICM, "licm", "Loop Invariant Code Motion", false, false)
208 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
209 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
210 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
211 INITIALIZE_PASS_DEPENDENCY(LCSSA)
212 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution)
213 INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfo)
214 INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
215 INITIALIZE_PASS_END(LICM, "licm", "Loop Invariant Code Motion", false, false)
217 Pass *llvm::createLICMPass() { return new LICM(); }
219 /// Hoist expressions out of the specified loop. Note, alias info for inner
220 /// loop is not preserved so it is not a good idea to run LICM multiple
221 /// times on one loop.
223 bool LICM::runOnLoop(Loop *L, LPPassManager &LPM) {
224 if (skipOptnoneFunction(L))
229 // Get our Loop and Alias Analysis information...
230 LI = &getAnalysis<LoopInfo>();
231 AA = &getAnalysis<AliasAnalysis>();
232 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
234 DataLayoutPass *DLP = getAnalysisIfAvailable<DataLayoutPass>();
235 DL = DLP ? &DLP->getDataLayout() : nullptr;
236 TLI = &getAnalysis<TargetLibraryInfo>();
238 assert(L->isLCSSAForm(*DT) && "Loop is not in LCSSA form.");
240 CurAST = new AliasSetTracker(*AA);
241 // Collect Alias info from subloops.
242 for (Loop::iterator LoopItr = L->begin(), LoopItrE = L->end();
243 LoopItr != LoopItrE; ++LoopItr) {
244 Loop *InnerL = *LoopItr;
245 AliasSetTracker *InnerAST = LoopToAliasSetMap[InnerL];
246 assert(InnerAST && "Where is my AST?");
248 // What if InnerLoop was modified by other passes ?
249 CurAST->add(*InnerAST);
251 // Once we've incorporated the inner loop's AST into ours, we don't need the
252 // subloop's anymore.
254 LoopToAliasSetMap.erase(InnerL);
259 // Get the preheader block to move instructions into...
260 Preheader = L->getLoopPreheader();
262 // Loop over the body of this loop, looking for calls, invokes, and stores.
263 // Because subloops have already been incorporated into AST, we skip blocks in
266 for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
269 if (LI->getLoopFor(BB) == L) // Ignore blocks in subloops.
270 CurAST->add(*BB); // Incorporate the specified basic block
274 // TODO: We've already searched for instructions which may throw in subloops.
275 // We may want to reuse this information.
276 for (Loop::block_iterator BB = L->block_begin(), BBE = L->block_end();
277 (BB != BBE) && !MayThrow ; ++BB)
278 for (BasicBlock::iterator I = (*BB)->begin(), E = (*BB)->end();
279 (I != E) && !MayThrow; ++I)
280 MayThrow |= I->mayThrow();
282 // We want to visit all of the instructions in this loop... that are not parts
283 // of our subloops (they have already had their invariants hoisted out of
284 // their loop, into this loop, so there is no need to process the BODIES of
287 // Traverse the body of the loop in depth first order on the dominator tree so
288 // that we are guaranteed to see definitions before we see uses. This allows
289 // us to sink instructions in one pass, without iteration. After sinking
290 // instructions, we perform another pass to hoist them out of the loop.
292 if (L->hasDedicatedExits())
293 SinkRegion(DT->getNode(L->getHeader()));
295 HoistRegion(DT->getNode(L->getHeader()));
297 // Now that all loop invariants have been removed from the loop, promote any
298 // memory references to scalars that we can.
299 if (!DisablePromotion && (Preheader || L->hasDedicatedExits())) {
300 SmallVector<BasicBlock *, 8> ExitBlocks;
301 SmallVector<Instruction *, 8> InsertPts;
302 PredIteratorCache PIC;
304 // Loop over all of the alias sets in the tracker object.
305 for (AliasSetTracker::iterator I = CurAST->begin(), E = CurAST->end();
307 PromoteAliasSet(*I, ExitBlocks, InsertPts, PIC);
309 // Once we have promoted values across the loop body we have to recursively
310 // reform LCSSA as any nested loop may now have values defined within the
311 // loop used in the outer loop.
312 // FIXME: This is really heavy handed. It would be a bit better to use an
313 // SSAUpdater strategy during promotion that was LCSSA aware and reformed
316 formLCSSARecursively(*L, *DT, getAnalysisIfAvailable<ScalarEvolution>());
319 // Check that neither this loop nor its parent have had LCSSA broken. LICM is
320 // specifically moving instructions across the loop boundary and so it is
321 // especially in need of sanity checking here.
322 assert(L->isLCSSAForm(*DT) && "Loop not left in LCSSA form after LICM!");
323 assert((!L->getParentLoop() || L->getParentLoop()->isLCSSAForm(*DT)) &&
324 "Parent loop not left in LCSSA form after LICM!");
326 // Clear out loops state information for the next iteration
330 // If this loop is nested inside of another one, save the alias information
331 // for when we process the outer loop.
332 if (L->getParentLoop())
333 LoopToAliasSetMap[L] = CurAST;
339 /// SinkRegion - Walk the specified region of the CFG (defined by all blocks
340 /// dominated by the specified block, and that are in the current loop) in
341 /// reverse depth first order w.r.t the DominatorTree. This allows us to visit
342 /// uses before definitions, allowing us to sink a loop body in one pass without
345 void LICM::SinkRegion(DomTreeNode *N) {
346 assert(N != nullptr && "Null dominator tree node?");
347 BasicBlock *BB = N->getBlock();
349 // If this subregion is not in the top level loop at all, exit.
350 if (!CurLoop->contains(BB)) return;
352 // We are processing blocks in reverse dfo, so process children first.
353 const std::vector<DomTreeNode*> &Children = N->getChildren();
354 for (unsigned i = 0, e = Children.size(); i != e; ++i)
355 SinkRegion(Children[i]);
357 // Only need to process the contents of this block if it is not part of a
358 // subloop (which would already have been processed).
359 if (inSubLoop(BB)) return;
361 for (BasicBlock::iterator II = BB->end(); II != BB->begin(); ) {
362 Instruction &I = *--II;
364 // If the instruction is dead, we would try to sink it because it isn't used
365 // in the loop, instead, just delete it.
366 if (isInstructionTriviallyDead(&I, TLI)) {
367 DEBUG(dbgs() << "LICM deleting dead inst: " << I << '\n');
369 CurAST->deleteValue(&I);
375 // Check to see if we can sink this instruction to the exit blocks
376 // of the loop. We can do this if the all users of the instruction are
377 // outside of the loop. In this case, it doesn't even matter if the
378 // operands of the instruction are loop invariant.
380 if (isNotUsedInLoop(I) && canSinkOrHoistInst(I)) {
387 /// HoistRegion - Walk the specified region of the CFG (defined by all blocks
388 /// dominated by the specified block, and that are in the current loop) in depth
389 /// first order w.r.t the DominatorTree. This allows us to visit definitions
390 /// before uses, allowing us to hoist a loop body in one pass without iteration.
392 void LICM::HoistRegion(DomTreeNode *N) {
393 assert(N != nullptr && "Null dominator tree node?");
394 BasicBlock *BB = N->getBlock();
396 // If this subregion is not in the top level loop at all, exit.
397 if (!CurLoop->contains(BB)) return;
399 // Only need to process the contents of this block if it is not part of a
400 // subloop (which would already have been processed).
402 for (BasicBlock::iterator II = BB->begin(), E = BB->end(); II != E; ) {
403 Instruction &I = *II++;
405 // Try constant folding this instruction. If all the operands are
406 // constants, it is technically hoistable, but it would be better to just
408 if (Constant *C = ConstantFoldInstruction(&I, DL, TLI)) {
409 DEBUG(dbgs() << "LICM folding inst: " << I << " --> " << *C << '\n');
410 CurAST->copyValue(&I, C);
411 CurAST->deleteValue(&I);
412 I.replaceAllUsesWith(C);
417 // Try hoisting the instruction out to the preheader. We can only do this
418 // if all of the operands of the instruction are loop invariant and if it
419 // is safe to hoist the instruction.
421 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
422 isSafeToExecuteUnconditionally(I))
426 const std::vector<DomTreeNode*> &Children = N->getChildren();
427 for (unsigned i = 0, e = Children.size(); i != e; ++i)
428 HoistRegion(Children[i]);
431 /// canSinkOrHoistInst - Return true if the hoister and sinker can handle this
434 bool LICM::canSinkOrHoistInst(Instruction &I) {
435 // Loads have extra constraints we have to verify before we can hoist them.
436 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) {
437 if (!LI->isUnordered())
438 return false; // Don't hoist volatile/atomic loads!
440 // Loads from constant memory are always safe to move, even if they end up
441 // in the same alias set as something that ends up being modified.
442 if (AA->pointsToConstantMemory(LI->getOperand(0)))
444 if (LI->getMetadata("invariant.load"))
447 // Don't hoist loads which have may-aliased stores in loop.
449 if (LI->getType()->isSized())
450 Size = AA->getTypeStoreSize(LI->getType());
453 LI->getAAMetadata(AAInfo);
455 return !pointerInvalidatedByLoop(LI->getOperand(0), Size, AAInfo);
456 } else if (CallInst *CI = dyn_cast<CallInst>(&I)) {
457 // Don't sink or hoist dbg info; it's legal, but not useful.
458 if (isa<DbgInfoIntrinsic>(I))
461 // Handle simple cases by querying alias analysis.
462 AliasAnalysis::ModRefBehavior Behavior = AA->getModRefBehavior(CI);
463 if (Behavior == AliasAnalysis::DoesNotAccessMemory)
465 if (AliasAnalysis::onlyReadsMemory(Behavior)) {
466 // If this call only reads from memory and there are no writes to memory
467 // in the loop, we can hoist or sink the call as appropriate.
468 bool FoundMod = false;
469 for (AliasSetTracker::iterator I = CurAST->begin(), E = CurAST->end();
472 if (!AS.isForwardingAliasSet() && AS.isMod()) {
477 if (!FoundMod) return true;
480 // FIXME: This should use mod/ref information to see if we can hoist or
486 // Only these instructions are hoistable/sinkable.
487 if (!isa<BinaryOperator>(I) && !isa<CastInst>(I) && !isa<SelectInst>(I) &&
488 !isa<GetElementPtrInst>(I) && !isa<CmpInst>(I) &&
489 !isa<InsertElementInst>(I) && !isa<ExtractElementInst>(I) &&
490 !isa<ShuffleVectorInst>(I) && !isa<ExtractValueInst>(I) &&
491 !isa<InsertValueInst>(I))
494 return isSafeToExecuteUnconditionally(I);
497 /// \brief Returns true if a PHINode is a trivially replaceable with an
500 /// This is true when all incoming values are that instruction. This pattern
501 /// occurs most often with LCSSA PHI nodes.
502 static bool isTriviallyReplacablePHI(PHINode &PN, Instruction &I) {
503 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
504 if (PN.getIncomingValue(i) != &I)
510 /// isNotUsedInLoop - Return true if the only users of this instruction are
511 /// outside of the loop. If this is true, we can sink the instruction to the
512 /// exit blocks of the loop.
514 bool LICM::isNotUsedInLoop(Instruction &I) {
515 for (User *U : I.users()) {
516 Instruction *UI = cast<Instruction>(U);
517 if (PHINode *PN = dyn_cast<PHINode>(UI)) {
518 // A PHI node where all of the incoming values are this instruction are
519 // special -- they can just be RAUW'ed with the instruction and thus
520 // don't require a use in the predecessor. This is a particular important
521 // special case because it is the pattern found in LCSSA form.
522 if (isTriviallyReplacablePHI(*PN, I)) {
523 if (CurLoop->contains(PN))
529 // Otherwise, PHI node uses occur in predecessor blocks if the incoming
530 // values. Check for such a use being inside the loop.
531 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
532 if (PN->getIncomingValue(i) == &I)
533 if (CurLoop->contains(PN->getIncomingBlock(i)))
539 if (CurLoop->contains(UI))
545 Instruction *LICM::CloneInstructionInExitBlock(Instruction &I,
546 BasicBlock &ExitBlock,
548 Instruction *New = I.clone();
549 ExitBlock.getInstList().insert(ExitBlock.getFirstInsertionPt(), New);
550 if (!I.getName().empty()) New->setName(I.getName() + ".le");
552 // Build LCSSA PHI nodes for any in-loop operands. Note that this is
553 // particularly cheap because we can rip off the PHI node that we're
554 // replacing for the number and blocks of the predecessors.
555 // OPT: If this shows up in a profile, we can instead finish sinking all
556 // invariant instructions, and then walk their operands to re-establish
557 // LCSSA. That will eliminate creating PHI nodes just to nuke them when
558 // sinking bottom-up.
559 for (User::op_iterator OI = New->op_begin(), OE = New->op_end(); OI != OE;
561 if (Instruction *OInst = dyn_cast<Instruction>(*OI))
562 if (Loop *OLoop = LI->getLoopFor(OInst->getParent()))
563 if (!OLoop->contains(&PN)) {
565 PHINode::Create(OInst->getType(), PN.getNumIncomingValues(),
566 OInst->getName() + ".lcssa", ExitBlock.begin());
567 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
568 OpPN->addIncoming(OInst, PN.getIncomingBlock(i));
574 /// sink - When an instruction is found to only be used outside of the loop,
575 /// this function moves it to the exit blocks and patches up SSA form as needed.
576 /// This method is guaranteed to remove the original instruction from its
577 /// position, and may either delete it or move it to outside of the loop.
579 void LICM::sink(Instruction &I) {
580 DEBUG(dbgs() << "LICM sinking instruction: " << I << "\n");
582 if (isa<LoadInst>(I)) ++NumMovedLoads;
583 else if (isa<CallInst>(I)) ++NumMovedCalls;
588 SmallVector<BasicBlock *, 32> ExitBlocks;
589 CurLoop->getUniqueExitBlocks(ExitBlocks);
590 SmallPtrSet<BasicBlock *, 32> ExitBlockSet(ExitBlocks.begin(), ExitBlocks.end());
593 // Clones of this instruction. Don't create more than one per exit block!
594 SmallDenseMap<BasicBlock *, Instruction *, 32> SunkCopies;
596 // If this instruction is only used outside of the loop, then all users are
597 // PHI nodes in exit blocks due to LCSSA form. Just RAUW them with clones of
599 while (!I.use_empty()) {
600 // The user must be a PHI node.
601 PHINode *PN = cast<PHINode>(I.user_back());
603 BasicBlock *ExitBlock = PN->getParent();
604 assert(ExitBlockSet.count(ExitBlock) &&
605 "The LCSSA PHI is not in an exit block!");
608 auto It = SunkCopies.find(ExitBlock);
609 if (It != SunkCopies.end())
612 New = SunkCopies[ExitBlock] =
613 CloneInstructionInExitBlock(I, *ExitBlock, *PN);
615 PN->replaceAllUsesWith(New);
616 PN->eraseFromParent();
619 CurAST->deleteValue(&I);
623 /// hoist - When an instruction is found to only use loop invariant operands
624 /// that is safe to hoist, this instruction is called to do the dirty work.
626 void LICM::hoist(Instruction &I) {
627 DEBUG(dbgs() << "LICM hoisting to " << Preheader->getName() << ": "
630 // Move the new node to the Preheader, before its terminator.
631 I.moveBefore(Preheader->getTerminator());
633 if (isa<LoadInst>(I)) ++NumMovedLoads;
634 else if (isa<CallInst>(I)) ++NumMovedCalls;
639 /// isSafeToExecuteUnconditionally - Only sink or hoist an instruction if it is
640 /// not a trapping instruction or if it is a trapping instruction and is
641 /// guaranteed to execute.
643 bool LICM::isSafeToExecuteUnconditionally(Instruction &Inst) {
644 // If it is not a trapping instruction, it is always safe to hoist.
645 if (isSafeToSpeculativelyExecute(&Inst, DL))
648 return isGuaranteedToExecute(Inst);
651 bool LICM::isGuaranteedToExecute(Instruction &Inst) {
653 // Somewhere in this loop there is an instruction which may throw and make us
658 // Otherwise we have to check to make sure that the instruction dominates all
659 // of the exit blocks. If it doesn't, then there is a path out of the loop
660 // which does not execute this instruction, so we can't hoist it.
662 // If the instruction is in the header block for the loop (which is very
663 // common), it is always guaranteed to dominate the exit blocks. Since this
664 // is a common case, and can save some work, check it now.
665 if (Inst.getParent() == CurLoop->getHeader())
668 // Get the exit blocks for the current loop.
669 SmallVector<BasicBlock*, 8> ExitBlocks;
670 CurLoop->getExitBlocks(ExitBlocks);
672 // Verify that the block dominates each of the exit blocks of the loop.
673 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
674 if (!DT->dominates(Inst.getParent(), ExitBlocks[i]))
677 // As a degenerate case, if the loop is statically infinite then we haven't
678 // proven anything since there are no exit blocks.
679 if (ExitBlocks.empty())
686 class LoopPromoter : public LoadAndStorePromoter {
687 Value *SomePtr; // Designated pointer to store to.
688 SmallPtrSet<Value*, 4> &PointerMustAliases;
689 SmallVectorImpl<BasicBlock*> &LoopExitBlocks;
690 SmallVectorImpl<Instruction*> &LoopInsertPts;
691 PredIteratorCache &PredCache;
692 AliasSetTracker &AST;
698 Value *maybeInsertLCSSAPHI(Value *V, BasicBlock *BB) const {
699 if (Instruction *I = dyn_cast<Instruction>(V))
700 if (Loop *L = LI.getLoopFor(I->getParent()))
701 if (!L->contains(BB)) {
702 // We need to create an LCSSA PHI node for the incoming value and
704 PHINode *PN = PHINode::Create(
705 I->getType(), PredCache.GetNumPreds(BB),
706 I->getName() + ".lcssa", BB->begin());
707 for (BasicBlock **PI = PredCache.GetPreds(BB); *PI; ++PI)
708 PN->addIncoming(I, *PI);
715 LoopPromoter(Value *SP, const SmallVectorImpl<Instruction *> &Insts,
716 SSAUpdater &S, SmallPtrSet<Value *, 4> &PMA,
717 SmallVectorImpl<BasicBlock *> &LEB,
718 SmallVectorImpl<Instruction *> &LIP, PredIteratorCache &PIC,
719 AliasSetTracker &ast, LoopInfo &li, DebugLoc dl, int alignment,
720 const AAMDNodes &AATags)
721 : LoadAndStorePromoter(Insts, S), SomePtr(SP), PointerMustAliases(PMA),
722 LoopExitBlocks(LEB), LoopInsertPts(LIP), PredCache(PIC), AST(ast),
723 LI(li), DL(dl), Alignment(alignment), AATags(AATags) {}
725 bool isInstInList(Instruction *I,
726 const SmallVectorImpl<Instruction*> &) const override {
728 if (LoadInst *LI = dyn_cast<LoadInst>(I))
729 Ptr = LI->getOperand(0);
731 Ptr = cast<StoreInst>(I)->getPointerOperand();
732 return PointerMustAliases.count(Ptr);
735 void doExtraRewritesBeforeFinalDeletion() const override {
736 // Insert stores after in the loop exit blocks. Each exit block gets a
737 // store of the live-out values that feed them. Since we've already told
738 // the SSA updater about the defs in the loop and the preheader
739 // definition, it is all set and we can start using it.
740 for (unsigned i = 0, e = LoopExitBlocks.size(); i != e; ++i) {
741 BasicBlock *ExitBlock = LoopExitBlocks[i];
742 Value *LiveInValue = SSA.GetValueInMiddleOfBlock(ExitBlock);
743 LiveInValue = maybeInsertLCSSAPHI(LiveInValue, ExitBlock);
744 Value *Ptr = maybeInsertLCSSAPHI(SomePtr, ExitBlock);
745 Instruction *InsertPos = LoopInsertPts[i];
746 StoreInst *NewSI = new StoreInst(LiveInValue, Ptr, InsertPos);
747 NewSI->setAlignment(Alignment);
748 NewSI->setDebugLoc(DL);
749 if (AATags) NewSI->setAAMetadata(AATags);
753 void replaceLoadWithValue(LoadInst *LI, Value *V) const override {
754 // Update alias analysis.
755 AST.copyValue(LI, V);
757 void instructionDeleted(Instruction *I) const override {
761 } // end anon namespace
763 /// PromoteAliasSet - Try to promote memory values to scalars by sinking
764 /// stores out of the loop and moving loads to before the loop. We do this by
765 /// looping over the stores in the loop, looking for stores to Must pointers
766 /// which are loop invariant.
768 void LICM::PromoteAliasSet(AliasSet &AS,
769 SmallVectorImpl<BasicBlock*> &ExitBlocks,
770 SmallVectorImpl<Instruction*> &InsertPts,
771 PredIteratorCache &PIC) {
772 // We can promote this alias set if it has a store, if it is a "Must" alias
773 // set, if the pointer is loop invariant, and if we are not eliminating any
774 // volatile loads or stores.
775 if (AS.isForwardingAliasSet() || !AS.isMod() || !AS.isMustAlias() ||
776 AS.isVolatile() || !CurLoop->isLoopInvariant(AS.begin()->getValue()))
779 assert(!AS.empty() &&
780 "Must alias set should have at least one pointer element in it!");
781 Value *SomePtr = AS.begin()->getValue();
783 // It isn't safe to promote a load/store from the loop if the load/store is
784 // conditional. For example, turning:
786 // for () { if (c) *P += 1; }
790 // tmp = *P; for () { if (c) tmp +=1; } *P = tmp;
792 // is not safe, because *P may only be valid to access if 'c' is true.
794 // It is safe to promote P if all uses are direct load/stores and if at
795 // least one is guaranteed to be executed.
796 bool GuaranteedToExecute = false;
798 SmallVector<Instruction*, 64> LoopUses;
799 SmallPtrSet<Value*, 4> PointerMustAliases;
801 // We start with an alignment of one and try to find instructions that allow
802 // us to prove better alignment.
803 unsigned Alignment = 1;
806 // Check that all of the pointers in the alias set have the same type. We
807 // cannot (yet) promote a memory location that is loaded and stored in
808 // different sizes. While we are at it, collect alignment and AA info.
809 for (AliasSet::iterator ASI = AS.begin(), E = AS.end(); ASI != E; ++ASI) {
810 Value *ASIV = ASI->getValue();
811 PointerMustAliases.insert(ASIV);
813 // Check that all of the pointers in the alias set have the same type. We
814 // cannot (yet) promote a memory location that is loaded and stored in
816 if (SomePtr->getType() != ASIV->getType())
819 for (User *U : ASIV->users()) {
820 // Ignore instructions that are outside the loop.
821 Instruction *UI = dyn_cast<Instruction>(U);
822 if (!UI || !CurLoop->contains(UI))
825 // If there is an non-load/store instruction in the loop, we can't promote
827 if (LoadInst *load = dyn_cast<LoadInst>(UI)) {
828 assert(!load->isVolatile() && "AST broken");
829 if (!load->isSimple())
831 } else if (StoreInst *store = dyn_cast<StoreInst>(UI)) {
832 // Stores *of* the pointer are not interesting, only stores *to* the
834 if (UI->getOperand(1) != ASIV)
836 assert(!store->isVolatile() && "AST broken");
837 if (!store->isSimple())
840 // Note that we only check GuaranteedToExecute inside the store case
841 // so that we do not introduce stores where they did not exist before
842 // (which would break the LLVM concurrency model).
844 // If the alignment of this instruction allows us to specify a more
845 // restrictive (and performant) alignment and if we are sure this
846 // instruction will be executed, update the alignment.
847 // Larger is better, with the exception of 0 being the best alignment.
848 unsigned InstAlignment = store->getAlignment();
849 if ((InstAlignment > Alignment || InstAlignment == 0) && Alignment != 0)
850 if (isGuaranteedToExecute(*UI)) {
851 GuaranteedToExecute = true;
852 Alignment = InstAlignment;
855 if (!GuaranteedToExecute)
856 GuaranteedToExecute = isGuaranteedToExecute(*UI);
859 return; // Not a load or store.
861 // Merge the AA tags.
862 if (LoopUses.empty()) {
863 // On the first load/store, just take its AA tags.
864 UI->getAAMetadata(AATags);
866 UI->getAAMetadata(AATags, /* Merge = */ true);
869 LoopUses.push_back(UI);
873 // If there isn't a guaranteed-to-execute instruction, we can't promote.
874 if (!GuaranteedToExecute)
877 // Otherwise, this is safe to promote, lets do it!
878 DEBUG(dbgs() << "LICM: Promoting value stored to in loop: " <<*SomePtr<<'\n');
882 // Grab a debug location for the inserted loads/stores; given that the
883 // inserted loads/stores have little relation to the original loads/stores,
884 // this code just arbitrarily picks a location from one, since any debug
885 // location is better than none.
886 DebugLoc DL = LoopUses[0]->getDebugLoc();
888 // Figure out the loop exits and their insertion points, if this is the
890 if (ExitBlocks.empty()) {
891 CurLoop->getUniqueExitBlocks(ExitBlocks);
892 InsertPts.resize(ExitBlocks.size());
893 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
894 InsertPts[i] = ExitBlocks[i]->getFirstInsertionPt();
897 // We use the SSAUpdater interface to insert phi nodes as required.
898 SmallVector<PHINode*, 16> NewPHIs;
899 SSAUpdater SSA(&NewPHIs);
900 LoopPromoter Promoter(SomePtr, LoopUses, SSA, PointerMustAliases, ExitBlocks,
901 InsertPts, PIC, *CurAST, *LI, DL, Alignment, AATags);
903 // Set up the preheader to have a definition of the value. It is the live-out
904 // value from the preheader that uses in the loop will use.
905 LoadInst *PreheaderLoad =
906 new LoadInst(SomePtr, SomePtr->getName()+".promoted",
907 Preheader->getTerminator());
908 PreheaderLoad->setAlignment(Alignment);
909 PreheaderLoad->setDebugLoc(DL);
910 if (AATags) PreheaderLoad->setAAMetadata(AATags);
911 SSA.AddAvailableValue(Preheader, PreheaderLoad);
913 // Rewrite all the loads in the loop and remember all the definitions from
914 // stores in the loop.
915 Promoter.run(LoopUses);
917 // If the SSAUpdater didn't use the load in the preheader, just zap it now.
918 if (PreheaderLoad->use_empty())
919 PreheaderLoad->eraseFromParent();
923 /// cloneBasicBlockAnalysis - Simple Analysis hook. Clone alias set info.
924 void LICM::cloneBasicBlockAnalysis(BasicBlock *From, BasicBlock *To, Loop *L) {
925 AliasSetTracker *AST = LoopToAliasSetMap.lookup(L);
929 AST->copyValue(From, To);
932 /// deleteAnalysisValue - Simple Analysis hook. Delete value V from alias
934 void LICM::deleteAnalysisValue(Value *V, Loop *L) {
935 AliasSetTracker *AST = LoopToAliasSetMap.lookup(L);