1 //===- IndVarSimplify.cpp - Induction Variable Elimination ----------------===//
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 transformation analyzes and transforms the induction variables (and
11 // computations derived from them) into simpler forms suitable for subsequent
12 // analysis and transformation.
14 // If the trip count of a loop is computable, this pass also makes the following
16 // 1. The exit condition for the loop is canonicalized to compare the
17 // induction value against the exit value. This turns loops like:
18 // 'for (i = 7; i*i < 1000; ++i)' into 'for (i = 0; i != 25; ++i)'
19 // 2. Any use outside of the loop of an expression derived from the indvar
20 // is changed to compute the derived value outside of the loop, eliminating
21 // the dependence on the exit value of the induction variable. If the only
22 // purpose of the loop is to compute the exit value of some derived
23 // expression, this transformation will make the loop dead.
25 //===----------------------------------------------------------------------===//
27 #include "llvm/Transforms/Scalar.h"
28 #include "llvm/ADT/DenseMap.h"
29 #include "llvm/ADT/SmallVector.h"
30 #include "llvm/ADT/Statistic.h"
31 #include "llvm/Analysis/LoopInfo.h"
32 #include "llvm/Analysis/LoopPass.h"
33 #include "llvm/Analysis/ScalarEvolutionExpander.h"
34 #include "llvm/Analysis/TargetLibraryInfo.h"
35 #include "llvm/Analysis/TargetTransformInfo.h"
36 #include "llvm/IR/BasicBlock.h"
37 #include "llvm/IR/CFG.h"
38 #include "llvm/IR/Constants.h"
39 #include "llvm/IR/DataLayout.h"
40 #include "llvm/IR/Dominators.h"
41 #include "llvm/IR/Instructions.h"
42 #include "llvm/IR/IntrinsicInst.h"
43 #include "llvm/IR/LLVMContext.h"
44 #include "llvm/IR/Type.h"
45 #include "llvm/Support/CommandLine.h"
46 #include "llvm/Support/Debug.h"
47 #include "llvm/Support/raw_ostream.h"
48 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
49 #include "llvm/Transforms/Utils/Local.h"
50 #include "llvm/Transforms/Utils/SimplifyIndVar.h"
53 #define DEBUG_TYPE "indvars"
55 STATISTIC(NumWidened , "Number of indvars widened");
56 STATISTIC(NumReplaced , "Number of exit values replaced");
57 STATISTIC(NumLFTR , "Number of loop exit tests replaced");
58 STATISTIC(NumElimExt , "Number of IV sign/zero extends eliminated");
59 STATISTIC(NumElimIV , "Number of congruent IVs eliminated");
61 // Trip count verification can be enabled by default under NDEBUG if we
62 // implement a strong expression equivalence checker in SCEV. Until then, we
63 // use the verify-indvars flag, which may assert in some cases.
64 static cl::opt<bool> VerifyIndvars(
65 "verify-indvars", cl::Hidden,
66 cl::desc("Verify the ScalarEvolution result after running indvars"));
68 static cl::opt<bool> ReduceLiveIVs("liv-reduce", cl::Hidden,
69 cl::desc("Reduce live induction variables."));
72 class IndVarSimplify : public LoopPass {
76 TargetLibraryInfo *TLI;
77 const TargetTransformInfo *TTI;
79 SmallVector<WeakVH, 16> DeadInsts;
83 static char ID; // Pass identification, replacement for typeid
85 : LoopPass(ID), LI(nullptr), SE(nullptr), DT(nullptr), Changed(false) {
86 initializeIndVarSimplifyPass(*PassRegistry::getPassRegistry());
89 bool runOnLoop(Loop *L, LPPassManager &LPM) override;
91 void getAnalysisUsage(AnalysisUsage &AU) const override {
92 AU.addRequired<DominatorTreeWrapperPass>();
93 AU.addRequired<LoopInfoWrapperPass>();
94 AU.addRequired<ScalarEvolution>();
95 AU.addRequiredID(LoopSimplifyID);
96 AU.addRequiredID(LCSSAID);
97 AU.addPreserved<ScalarEvolution>();
98 AU.addPreservedID(LoopSimplifyID);
99 AU.addPreservedID(LCSSAID);
100 AU.setPreservesCFG();
104 void releaseMemory() override {
108 bool isValidRewrite(Value *FromVal, Value *ToVal);
110 void HandleFloatingPointIV(Loop *L, PHINode *PH);
111 void RewriteNonIntegerIVs(Loop *L);
113 void SimplifyAndExtend(Loop *L, SCEVExpander &Rewriter, LPPassManager &LPM);
115 void RewriteLoopExitValues(Loop *L, SCEVExpander &Rewriter);
117 Value *LinearFunctionTestReplace(Loop *L, const SCEV *BackedgeTakenCount,
118 PHINode *IndVar, SCEVExpander &Rewriter);
120 void SinkUnusedInvariants(Loop *L);
124 char IndVarSimplify::ID = 0;
125 INITIALIZE_PASS_BEGIN(IndVarSimplify, "indvars",
126 "Induction Variable Simplification", false, false)
127 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
128 INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
129 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution)
130 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
131 INITIALIZE_PASS_DEPENDENCY(LCSSA)
132 INITIALIZE_PASS_END(IndVarSimplify, "indvars",
133 "Induction Variable Simplification", false, false)
135 Pass *llvm::createIndVarSimplifyPass() {
136 return new IndVarSimplify();
139 /// isValidRewrite - Return true if the SCEV expansion generated by the
140 /// rewriter can replace the original value. SCEV guarantees that it
141 /// produces the same value, but the way it is produced may be illegal IR.
142 /// Ideally, this function will only be called for verification.
143 bool IndVarSimplify::isValidRewrite(Value *FromVal, Value *ToVal) {
144 // If an SCEV expression subsumed multiple pointers, its expansion could
145 // reassociate the GEP changing the base pointer. This is illegal because the
146 // final address produced by a GEP chain must be inbounds relative to its
147 // underlying object. Otherwise basic alias analysis, among other things,
148 // could fail in a dangerous way. Ultimately, SCEV will be improved to avoid
149 // producing an expression involving multiple pointers. Until then, we must
152 // Retrieve the pointer operand of the GEP. Don't use GetUnderlyingObject
153 // because it understands lcssa phis while SCEV does not.
154 Value *FromPtr = FromVal;
155 Value *ToPtr = ToVal;
156 if (GEPOperator *GEP = dyn_cast<GEPOperator>(FromVal)) {
157 FromPtr = GEP->getPointerOperand();
159 if (GEPOperator *GEP = dyn_cast<GEPOperator>(ToVal)) {
160 ToPtr = GEP->getPointerOperand();
162 if (FromPtr != FromVal || ToPtr != ToVal) {
163 // Quickly check the common case
164 if (FromPtr == ToPtr)
167 // SCEV may have rewritten an expression that produces the GEP's pointer
168 // operand. That's ok as long as the pointer operand has the same base
169 // pointer. Unlike GetUnderlyingObject(), getPointerBase() will find the
170 // base of a recurrence. This handles the case in which SCEV expansion
171 // converts a pointer type recurrence into a nonrecurrent pointer base
172 // indexed by an integer recurrence.
174 // If the GEP base pointer is a vector of pointers, abort.
175 if (!FromPtr->getType()->isPointerTy() || !ToPtr->getType()->isPointerTy())
178 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr));
179 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr));
180 if (FromBase == ToBase)
183 DEBUG(dbgs() << "INDVARS: GEP rewrite bail out "
184 << *FromBase << " != " << *ToBase << "\n");
191 /// Determine the insertion point for this user. By default, insert immediately
192 /// before the user. SCEVExpander or LICM will hoist loop invariants out of the
193 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
194 /// common dominator for the incoming blocks.
195 static Instruction *getInsertPointForUses(Instruction *User, Value *Def,
197 PHINode *PHI = dyn_cast<PHINode>(User);
201 Instruction *InsertPt = nullptr;
202 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
203 if (PHI->getIncomingValue(i) != Def)
206 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
208 InsertPt = InsertBB->getTerminator();
211 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
212 InsertPt = InsertBB->getTerminator();
214 assert(InsertPt && "Missing phi operand");
215 assert((!isa<Instruction>(Def) ||
216 DT->dominates(cast<Instruction>(Def), InsertPt)) &&
217 "def does not dominate all uses");
221 //===----------------------------------------------------------------------===//
222 // RewriteNonIntegerIVs and helpers. Prefer integer IVs.
223 //===----------------------------------------------------------------------===//
225 /// ConvertToSInt - Convert APF to an integer, if possible.
226 static bool ConvertToSInt(const APFloat &APF, int64_t &IntVal) {
227 bool isExact = false;
228 // See if we can convert this to an int64_t
230 if (APF.convertToInteger(&UIntVal, 64, true, APFloat::rmTowardZero,
231 &isExact) != APFloat::opOK || !isExact)
237 /// HandleFloatingPointIV - If the loop has floating induction variable
238 /// then insert corresponding integer induction variable if possible.
240 /// for(double i = 0; i < 10000; ++i)
242 /// is converted into
243 /// for(int i = 0; i < 10000; ++i)
246 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
247 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
248 unsigned BackEdge = IncomingEdge^1;
250 // Check incoming value.
251 ConstantFP *InitValueVal =
252 dyn_cast<ConstantFP>(PN->getIncomingValue(IncomingEdge));
255 if (!InitValueVal || !ConvertToSInt(InitValueVal->getValueAPF(), InitValue))
258 // Check IV increment. Reject this PN if increment operation is not
259 // an add or increment value can not be represented by an integer.
260 BinaryOperator *Incr =
261 dyn_cast<BinaryOperator>(PN->getIncomingValue(BackEdge));
262 if (Incr == nullptr || Incr->getOpcode() != Instruction::FAdd) return;
264 // If this is not an add of the PHI with a constantfp, or if the constant fp
265 // is not an integer, bail out.
266 ConstantFP *IncValueVal = dyn_cast<ConstantFP>(Incr->getOperand(1));
268 if (IncValueVal == nullptr || Incr->getOperand(0) != PN ||
269 !ConvertToSInt(IncValueVal->getValueAPF(), IncValue))
272 // Check Incr uses. One user is PN and the other user is an exit condition
273 // used by the conditional terminator.
274 Value::user_iterator IncrUse = Incr->user_begin();
275 Instruction *U1 = cast<Instruction>(*IncrUse++);
276 if (IncrUse == Incr->user_end()) return;
277 Instruction *U2 = cast<Instruction>(*IncrUse++);
278 if (IncrUse != Incr->user_end()) return;
280 // Find exit condition, which is an fcmp. If it doesn't exist, or if it isn't
281 // only used by a branch, we can't transform it.
282 FCmpInst *Compare = dyn_cast<FCmpInst>(U1);
284 Compare = dyn_cast<FCmpInst>(U2);
285 if (!Compare || !Compare->hasOneUse() ||
286 !isa<BranchInst>(Compare->user_back()))
289 BranchInst *TheBr = cast<BranchInst>(Compare->user_back());
291 // We need to verify that the branch actually controls the iteration count
292 // of the loop. If not, the new IV can overflow and no one will notice.
293 // The branch block must be in the loop and one of the successors must be out
295 assert(TheBr->isConditional() && "Can't use fcmp if not conditional");
296 if (!L->contains(TheBr->getParent()) ||
297 (L->contains(TheBr->getSuccessor(0)) &&
298 L->contains(TheBr->getSuccessor(1))))
302 // If it isn't a comparison with an integer-as-fp (the exit value), we can't
304 ConstantFP *ExitValueVal = dyn_cast<ConstantFP>(Compare->getOperand(1));
306 if (ExitValueVal == nullptr ||
307 !ConvertToSInt(ExitValueVal->getValueAPF(), ExitValue))
310 // Find new predicate for integer comparison.
311 CmpInst::Predicate NewPred = CmpInst::BAD_ICMP_PREDICATE;
312 switch (Compare->getPredicate()) {
313 default: return; // Unknown comparison.
314 case CmpInst::FCMP_OEQ:
315 case CmpInst::FCMP_UEQ: NewPred = CmpInst::ICMP_EQ; break;
316 case CmpInst::FCMP_ONE:
317 case CmpInst::FCMP_UNE: NewPred = CmpInst::ICMP_NE; break;
318 case CmpInst::FCMP_OGT:
319 case CmpInst::FCMP_UGT: NewPred = CmpInst::ICMP_SGT; break;
320 case CmpInst::FCMP_OGE:
321 case CmpInst::FCMP_UGE: NewPred = CmpInst::ICMP_SGE; break;
322 case CmpInst::FCMP_OLT:
323 case CmpInst::FCMP_ULT: NewPred = CmpInst::ICMP_SLT; break;
324 case CmpInst::FCMP_OLE:
325 case CmpInst::FCMP_ULE: NewPred = CmpInst::ICMP_SLE; break;
328 // We convert the floating point induction variable to a signed i32 value if
329 // we can. This is only safe if the comparison will not overflow in a way
330 // that won't be trapped by the integer equivalent operations. Check for this
332 // TODO: We could use i64 if it is native and the range requires it.
334 // The start/stride/exit values must all fit in signed i32.
335 if (!isInt<32>(InitValue) || !isInt<32>(IncValue) || !isInt<32>(ExitValue))
338 // If not actually striding (add x, 0.0), avoid touching the code.
342 // Positive and negative strides have different safety conditions.
344 // If we have a positive stride, we require the init to be less than the
346 if (InitValue >= ExitValue)
349 uint32_t Range = uint32_t(ExitValue-InitValue);
350 // Check for infinite loop, either:
351 // while (i <= Exit) or until (i > Exit)
352 if (NewPred == CmpInst::ICMP_SLE || NewPred == CmpInst::ICMP_SGT) {
353 if (++Range == 0) return; // Range overflows.
356 unsigned Leftover = Range % uint32_t(IncValue);
358 // If this is an equality comparison, we require that the strided value
359 // exactly land on the exit value, otherwise the IV condition will wrap
360 // around and do things the fp IV wouldn't.
361 if ((NewPred == CmpInst::ICMP_EQ || NewPred == CmpInst::ICMP_NE) &&
365 // If the stride would wrap around the i32 before exiting, we can't
367 if (Leftover != 0 && int32_t(ExitValue+IncValue) < ExitValue)
371 // If we have a negative stride, we require the init to be greater than the
373 if (InitValue <= ExitValue)
376 uint32_t Range = uint32_t(InitValue-ExitValue);
377 // Check for infinite loop, either:
378 // while (i >= Exit) or until (i < Exit)
379 if (NewPred == CmpInst::ICMP_SGE || NewPred == CmpInst::ICMP_SLT) {
380 if (++Range == 0) return; // Range overflows.
383 unsigned Leftover = Range % uint32_t(-IncValue);
385 // If this is an equality comparison, we require that the strided value
386 // exactly land on the exit value, otherwise the IV condition will wrap
387 // around and do things the fp IV wouldn't.
388 if ((NewPred == CmpInst::ICMP_EQ || NewPred == CmpInst::ICMP_NE) &&
392 // If the stride would wrap around the i32 before exiting, we can't
394 if (Leftover != 0 && int32_t(ExitValue+IncValue) > ExitValue)
398 IntegerType *Int32Ty = Type::getInt32Ty(PN->getContext());
400 // Insert new integer induction variable.
401 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
402 NewPHI->addIncoming(ConstantInt::get(Int32Ty, InitValue),
403 PN->getIncomingBlock(IncomingEdge));
406 BinaryOperator::CreateAdd(NewPHI, ConstantInt::get(Int32Ty, IncValue),
407 Incr->getName()+".int", Incr);
408 NewPHI->addIncoming(NewAdd, PN->getIncomingBlock(BackEdge));
410 ICmpInst *NewCompare = new ICmpInst(TheBr, NewPred, NewAdd,
411 ConstantInt::get(Int32Ty, ExitValue),
414 // In the following deletions, PN may become dead and may be deleted.
415 // Use a WeakVH to observe whether this happens.
418 // Delete the old floating point exit comparison. The branch starts using the
420 NewCompare->takeName(Compare);
421 Compare->replaceAllUsesWith(NewCompare);
422 RecursivelyDeleteTriviallyDeadInstructions(Compare, TLI);
424 // Delete the old floating point increment.
425 Incr->replaceAllUsesWith(UndefValue::get(Incr->getType()));
426 RecursivelyDeleteTriviallyDeadInstructions(Incr, TLI);
428 // If the FP induction variable still has uses, this is because something else
429 // in the loop uses its value. In order to canonicalize the induction
430 // variable, we chose to eliminate the IV and rewrite it in terms of an
433 // We give preference to sitofp over uitofp because it is faster on most
436 Value *Conv = new SIToFPInst(NewPHI, PN->getType(), "indvar.conv",
437 PN->getParent()->getFirstInsertionPt());
438 PN->replaceAllUsesWith(Conv);
439 RecursivelyDeleteTriviallyDeadInstructions(PN, TLI);
444 void IndVarSimplify::RewriteNonIntegerIVs(Loop *L) {
445 // First step. Check to see if there are any floating-point recurrences.
446 // If there are, change them into integer recurrences, permitting analysis by
447 // the SCEV routines.
449 BasicBlock *Header = L->getHeader();
451 SmallVector<WeakVH, 8> PHIs;
452 for (BasicBlock::iterator I = Header->begin();
453 PHINode *PN = dyn_cast<PHINode>(I); ++I)
456 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
457 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i]))
458 HandleFloatingPointIV(L, PN);
460 // If the loop previously had floating-point IV, ScalarEvolution
461 // may not have been able to compute a trip count. Now that we've done some
462 // re-writing, the trip count may be computable.
467 //===----------------------------------------------------------------------===//
468 // RewriteLoopExitValues - Optimize IV users outside the loop.
469 // As a side effect, reduces the amount of IV processing within the loop.
470 //===----------------------------------------------------------------------===//
472 /// RewriteLoopExitValues - Check to see if this loop has a computable
473 /// loop-invariant execution count. If so, this means that we can compute the
474 /// final value of any expressions that are recurrent in the loop, and
475 /// substitute the exit values from the loop into any instructions outside of
476 /// the loop that use the final values of the current expressions.
478 /// This is mostly redundant with the regular IndVarSimplify activities that
479 /// happen later, except that it's more powerful in some cases, because it's
480 /// able to brute-force evaluate arbitrary instructions as long as they have
481 /// constant operands at the beginning of the loop.
482 void IndVarSimplify::RewriteLoopExitValues(Loop *L, SCEVExpander &Rewriter) {
483 // Verify the input to the pass in already in LCSSA form.
484 assert(L->isLCSSAForm(*DT));
486 SmallVector<BasicBlock*, 8> ExitBlocks;
487 L->getUniqueExitBlocks(ExitBlocks);
489 // Find all values that are computed inside the loop, but used outside of it.
490 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
491 // the exit blocks of the loop to find them.
492 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
493 BasicBlock *ExitBB = ExitBlocks[i];
495 // If there are no PHI nodes in this exit block, then no values defined
496 // inside the loop are used on this path, skip it.
497 PHINode *PN = dyn_cast<PHINode>(ExitBB->begin());
500 unsigned NumPreds = PN->getNumIncomingValues();
502 // We would like to be able to RAUW single-incoming value PHI nodes. We
503 // have to be certain this is safe even when this is an LCSSA PHI node.
504 // While the computed exit value is no longer varying in *this* loop, the
505 // exit block may be an exit block for an outer containing loop as well,
506 // the exit value may be varying in the outer loop, and thus it may still
507 // require an LCSSA PHI node. The safe case is when this is
508 // single-predecessor PHI node (LCSSA) and the exit block containing it is
509 // part of the enclosing loop, or this is the outer most loop of the nest.
510 // In either case the exit value could (at most) be varying in the same
511 // loop body as the phi node itself. Thus if it is in turn used outside of
512 // an enclosing loop it will only be via a separate LCSSA node.
513 bool LCSSASafePhiForRAUW =
515 (!L->getParentLoop() || L->getParentLoop() == LI->getLoopFor(ExitBB));
517 // Iterate over all of the PHI nodes.
518 BasicBlock::iterator BBI = ExitBB->begin();
519 while ((PN = dyn_cast<PHINode>(BBI++))) {
521 continue; // dead use, don't replace it
523 // SCEV only supports integer expressions for now.
524 if (!PN->getType()->isIntegerTy() && !PN->getType()->isPointerTy())
527 // It's necessary to tell ScalarEvolution about this explicitly so that
528 // it can walk the def-use list and forget all SCEVs, as it may not be
529 // watching the PHI itself. Once the new exit value is in place, there
530 // may not be a def-use connection between the loop and every instruction
531 // which got a SCEVAddRecExpr for that loop.
534 // Iterate over all of the values in all the PHI nodes.
535 for (unsigned i = 0; i != NumPreds; ++i) {
536 // If the value being merged in is not integer or is not defined
537 // in the loop, skip it.
538 Value *InVal = PN->getIncomingValue(i);
539 if (!isa<Instruction>(InVal))
542 // If this pred is for a subloop, not L itself, skip it.
543 if (LI->getLoopFor(PN->getIncomingBlock(i)) != L)
544 continue; // The Block is in a subloop, skip it.
546 // Check that InVal is defined in the loop.
547 Instruction *Inst = cast<Instruction>(InVal);
548 if (!L->contains(Inst))
551 // Okay, this instruction has a user outside of the current loop
552 // and varies predictably *inside* the loop. Evaluate the value it
553 // contains when the loop exits, if possible.
554 const SCEV *ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop());
555 if (!SE->isLoopInvariant(ExitValue, L) ||
556 !isSafeToExpand(ExitValue, *SE))
559 // Computing the value outside of the loop brings no benefit if :
560 // - it is definitely used inside the loop in a way which can not be
562 // - no use outside of the loop can take advantage of hoisting the
563 // computation out of the loop
564 if (ExitValue->getSCEVType()>=scMulExpr) {
565 unsigned NumHardInternalUses = 0;
566 unsigned NumSoftExternalUses = 0;
567 unsigned NumUses = 0;
568 for (auto IB = Inst->user_begin(), IE = Inst->user_end();
569 IB != IE && NumUses <= 6; ++IB) {
570 Instruction *UseInstr = cast<Instruction>(*IB);
571 unsigned Opc = UseInstr->getOpcode();
573 if (L->contains(UseInstr)) {
574 if (Opc == Instruction::Call || Opc == Instruction::Ret)
575 NumHardInternalUses++;
577 if (Opc == Instruction::PHI) {
578 // Do not count the Phi as a use. LCSSA may have inserted
579 // plenty of trivial ones.
581 for (auto PB = UseInstr->user_begin(),
582 PE = UseInstr->user_end();
583 PB != PE && NumUses <= 6; ++PB, ++NumUses) {
584 unsigned PhiOpc = cast<Instruction>(*PB)->getOpcode();
585 if (PhiOpc != Instruction::Call && PhiOpc != Instruction::Ret)
586 NumSoftExternalUses++;
590 if (Opc != Instruction::Call && Opc != Instruction::Ret)
591 NumSoftExternalUses++;
594 if (NumUses <= 6 && NumHardInternalUses && !NumSoftExternalUses)
598 Value *ExitVal = Rewriter.expandCodeFor(ExitValue, PN->getType(), Inst);
600 DEBUG(dbgs() << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal << '\n'
601 << " LoopVal = " << *Inst << "\n");
603 if (!isValidRewrite(Inst, ExitVal)) {
604 DeadInsts.push_back(ExitVal);
610 PN->setIncomingValue(i, ExitVal);
612 // If this instruction is dead now, delete it. Don't do it now to avoid
613 // invalidating iterators.
614 if (isInstructionTriviallyDead(Inst, TLI))
615 DeadInsts.push_back(Inst);
617 // If we determined that this PHI is safe to replace even if an LCSSA
619 if (LCSSASafePhiForRAUW) {
620 PN->replaceAllUsesWith(ExitVal);
621 PN->eraseFromParent();
625 // If we were unable to completely replace the PHI node, clone the PHI and
626 // delete the original one. This purges the original phi.
627 if (!LCSSASafePhiForRAUW) {
628 PHINode *NewPN = cast<PHINode>(PN->clone());
630 NewPN->insertBefore(PN);
631 PN->replaceAllUsesWith(NewPN);
632 PN->eraseFromParent();
637 // The insertion point instruction may have been deleted; clear it out
638 // so that the rewriter doesn't trip over it later.
639 Rewriter.clearInsertPoint();
642 //===----------------------------------------------------------------------===//
643 // IV Widening - Extend the width of an IV to cover its widest uses.
644 //===----------------------------------------------------------------------===//
647 // Collect information about induction variables that are used by sign/zero
648 // extend operations. This information is recorded by CollectExtend and
649 // provides the input to WidenIV.
652 Type *WidestNativeType; // Widest integer type created [sz]ext
653 bool IsSigned; // Was a sext user seen before a zext?
655 WideIVInfo() : NarrowIV(nullptr), WidestNativeType(nullptr),
660 /// visitCast - Update information about the induction variable that is
661 /// extended by this sign or zero extend operation. This is used to determine
662 /// the final width of the IV before actually widening it.
663 static void visitIVCast(CastInst *Cast, WideIVInfo &WI, ScalarEvolution *SE,
664 const TargetTransformInfo *TTI) {
665 bool IsSigned = Cast->getOpcode() == Instruction::SExt;
666 if (!IsSigned && Cast->getOpcode() != Instruction::ZExt)
669 Type *Ty = Cast->getType();
670 uint64_t Width = SE->getTypeSizeInBits(Ty);
671 if (!Cast->getModule()->getDataLayout().isLegalInteger(Width))
674 // Cast is either an sext or zext up to this point.
675 // We should not widen an indvar if arithmetics on the wider indvar are more
676 // expensive than those on the narrower indvar. We check only the cost of ADD
677 // because at least an ADD is required to increment the induction variable. We
678 // could compute more comprehensively the cost of all instructions on the
679 // induction variable when necessary.
681 TTI->getArithmeticInstrCost(Instruction::Add, Ty) >
682 TTI->getArithmeticInstrCost(Instruction::Add,
683 Cast->getOperand(0)->getType())) {
687 if (!WI.WidestNativeType) {
688 WI.WidestNativeType = SE->getEffectiveSCEVType(Ty);
689 WI.IsSigned = IsSigned;
693 // We extend the IV to satisfy the sign of its first user, arbitrarily.
694 if (WI.IsSigned != IsSigned)
697 if (Width > SE->getTypeSizeInBits(WI.WidestNativeType))
698 WI.WidestNativeType = SE->getEffectiveSCEVType(Ty);
703 /// NarrowIVDefUse - Record a link in the Narrow IV def-use chain along with the
704 /// WideIV that computes the same value as the Narrow IV def. This avoids
705 /// caching Use* pointers.
706 struct NarrowIVDefUse {
707 Instruction *NarrowDef;
708 Instruction *NarrowUse;
709 Instruction *WideDef;
711 NarrowIVDefUse(): NarrowDef(nullptr), NarrowUse(nullptr), WideDef(nullptr) {}
713 NarrowIVDefUse(Instruction *ND, Instruction *NU, Instruction *WD):
714 NarrowDef(ND), NarrowUse(NU), WideDef(WD) {}
717 /// WidenIV - The goal of this transform is to remove sign and zero extends
718 /// without creating any new induction variables. To do this, it creates a new
719 /// phi of the wider type and redirects all users, either removing extends or
720 /// inserting truncs whenever we stop propagating the type.
736 Instruction *WideInc;
737 const SCEV *WideIncExpr;
738 SmallVectorImpl<WeakVH> &DeadInsts;
740 SmallPtrSet<Instruction*,16> Widened;
741 SmallVector<NarrowIVDefUse, 8> NarrowIVUsers;
744 WidenIV(const WideIVInfo &WI, LoopInfo *LInfo,
745 ScalarEvolution *SEv, DominatorTree *DTree,
746 SmallVectorImpl<WeakVH> &DI) :
747 OrigPhi(WI.NarrowIV),
748 WideType(WI.WidestNativeType),
749 IsSigned(WI.IsSigned),
751 L(LI->getLoopFor(OrigPhi->getParent())),
756 WideIncExpr(nullptr),
758 assert(L->getHeader() == OrigPhi->getParent() && "Phi must be an IV");
761 PHINode *CreateWideIV(SCEVExpander &Rewriter);
764 Value *getExtend(Value *NarrowOper, Type *WideType, bool IsSigned,
767 Instruction *CloneIVUser(NarrowIVDefUse DU);
769 const SCEVAddRecExpr *GetWideRecurrence(Instruction *NarrowUse);
771 const SCEVAddRecExpr* GetExtendedOperandRecurrence(NarrowIVDefUse DU);
773 const SCEV *GetSCEVByOpCode(const SCEV *LHS, const SCEV *RHS,
774 unsigned OpCode) const;
776 Instruction *WidenIVUse(NarrowIVDefUse DU, SCEVExpander &Rewriter);
778 bool WidenLoopCompare(NarrowIVDefUse DU);
780 void pushNarrowIVUsers(Instruction *NarrowDef, Instruction *WideDef);
782 } // anonymous namespace
784 /// isLoopInvariant - Perform a quick domtree based check for loop invariance
785 /// assuming that V is used within the loop. LoopInfo::isLoopInvariant() seems
786 /// gratuitous for this purpose.
787 static bool isLoopInvariant(Value *V, const Loop *L, const DominatorTree *DT) {
788 Instruction *Inst = dyn_cast<Instruction>(V);
792 return DT->properlyDominates(Inst->getParent(), L->getHeader());
795 Value *WidenIV::getExtend(Value *NarrowOper, Type *WideType, bool IsSigned,
797 // Set the debug location and conservative insertion point.
798 IRBuilder<> Builder(Use);
799 // Hoist the insertion point into loop preheaders as far as possible.
800 for (const Loop *L = LI->getLoopFor(Use->getParent());
801 L && L->getLoopPreheader() && isLoopInvariant(NarrowOper, L, DT);
802 L = L->getParentLoop())
803 Builder.SetInsertPoint(L->getLoopPreheader()->getTerminator());
805 return IsSigned ? Builder.CreateSExt(NarrowOper, WideType) :
806 Builder.CreateZExt(NarrowOper, WideType);
809 /// CloneIVUser - Instantiate a wide operation to replace a narrow
810 /// operation. This only needs to handle operations that can evaluation to
811 /// SCEVAddRec. It can safely return 0 for any operation we decide not to clone.
812 Instruction *WidenIV::CloneIVUser(NarrowIVDefUse DU) {
813 unsigned Opcode = DU.NarrowUse->getOpcode();
817 case Instruction::Add:
818 case Instruction::Mul:
819 case Instruction::UDiv:
820 case Instruction::Sub:
821 case Instruction::And:
822 case Instruction::Or:
823 case Instruction::Xor:
824 case Instruction::Shl:
825 case Instruction::LShr:
826 case Instruction::AShr:
827 DEBUG(dbgs() << "Cloning IVUser: " << *DU.NarrowUse << "\n");
829 // Replace NarrowDef operands with WideDef. Otherwise, we don't know
830 // anything about the narrow operand yet so must insert a [sz]ext. It is
831 // probably loop invariant and will be folded or hoisted. If it actually
832 // comes from a widened IV, it should be removed during a future call to
834 Value *LHS = (DU.NarrowUse->getOperand(0) == DU.NarrowDef) ? DU.WideDef :
835 getExtend(DU.NarrowUse->getOperand(0), WideType, IsSigned, DU.NarrowUse);
836 Value *RHS = (DU.NarrowUse->getOperand(1) == DU.NarrowDef) ? DU.WideDef :
837 getExtend(DU.NarrowUse->getOperand(1), WideType, IsSigned, DU.NarrowUse);
839 BinaryOperator *NarrowBO = cast<BinaryOperator>(DU.NarrowUse);
840 BinaryOperator *WideBO = BinaryOperator::Create(NarrowBO->getOpcode(),
842 NarrowBO->getName());
843 IRBuilder<> Builder(DU.NarrowUse);
844 Builder.Insert(WideBO);
845 if (const OverflowingBinaryOperator *OBO =
846 dyn_cast<OverflowingBinaryOperator>(NarrowBO)) {
847 if (OBO->hasNoUnsignedWrap()) WideBO->setHasNoUnsignedWrap();
848 if (OBO->hasNoSignedWrap()) WideBO->setHasNoSignedWrap();
854 const SCEV *WidenIV::GetSCEVByOpCode(const SCEV *LHS, const SCEV *RHS,
855 unsigned OpCode) const {
856 if (OpCode == Instruction::Add)
857 return SE->getAddExpr(LHS, RHS);
858 if (OpCode == Instruction::Sub)
859 return SE->getMinusSCEV(LHS, RHS);
860 if (OpCode == Instruction::Mul)
861 return SE->getMulExpr(LHS, RHS);
863 llvm_unreachable("Unsupported opcode.");
866 /// No-wrap operations can transfer sign extension of their result to their
867 /// operands. Generate the SCEV value for the widened operation without
868 /// actually modifying the IR yet. If the expression after extending the
869 /// operands is an AddRec for this loop, return it.
870 const SCEVAddRecExpr* WidenIV::GetExtendedOperandRecurrence(NarrowIVDefUse DU) {
872 // Handle the common case of add<nsw/nuw>
873 const unsigned OpCode = DU.NarrowUse->getOpcode();
874 // Only Add/Sub/Mul instructions supported yet.
875 if (OpCode != Instruction::Add && OpCode != Instruction::Sub &&
876 OpCode != Instruction::Mul)
879 // One operand (NarrowDef) has already been extended to WideDef. Now determine
880 // if extending the other will lead to a recurrence.
881 const unsigned ExtendOperIdx =
882 DU.NarrowUse->getOperand(0) == DU.NarrowDef ? 1 : 0;
883 assert(DU.NarrowUse->getOperand(1-ExtendOperIdx) == DU.NarrowDef && "bad DU");
885 const SCEV *ExtendOperExpr = nullptr;
886 const OverflowingBinaryOperator *OBO =
887 cast<OverflowingBinaryOperator>(DU.NarrowUse);
888 if (IsSigned && OBO->hasNoSignedWrap())
889 ExtendOperExpr = SE->getSignExtendExpr(
890 SE->getSCEV(DU.NarrowUse->getOperand(ExtendOperIdx)), WideType);
891 else if(!IsSigned && OBO->hasNoUnsignedWrap())
892 ExtendOperExpr = SE->getZeroExtendExpr(
893 SE->getSCEV(DU.NarrowUse->getOperand(ExtendOperIdx)), WideType);
897 // When creating this SCEV expr, don't apply the current operations NSW or NUW
898 // flags. This instruction may be guarded by control flow that the no-wrap
899 // behavior depends on. Non-control-equivalent instructions can be mapped to
900 // the same SCEV expression, and it would be incorrect to transfer NSW/NUW
901 // semantics to those operations.
902 const SCEV *lhs = SE->getSCEV(DU.WideDef);
903 const SCEV *rhs = ExtendOperExpr;
905 // Let's swap operands to the initial order for the case of non-commutative
906 // operations, like SUB. See PR21014.
907 if (ExtendOperIdx == 0)
909 const SCEVAddRecExpr *AddRec =
910 dyn_cast<SCEVAddRecExpr>(GetSCEVByOpCode(lhs, rhs, OpCode));
912 if (!AddRec || AddRec->getLoop() != L)
917 /// GetWideRecurrence - Is this instruction potentially interesting for further
918 /// simplification after widening it's type? In other words, can the
919 /// extend be safely hoisted out of the loop with SCEV reducing the value to a
920 /// recurrence on the same loop. If so, return the sign or zero extended
921 /// recurrence. Otherwise return NULL.
922 const SCEVAddRecExpr *WidenIV::GetWideRecurrence(Instruction *NarrowUse) {
923 if (!SE->isSCEVable(NarrowUse->getType()))
926 const SCEV *NarrowExpr = SE->getSCEV(NarrowUse);
927 if (SE->getTypeSizeInBits(NarrowExpr->getType())
928 >= SE->getTypeSizeInBits(WideType)) {
929 // NarrowUse implicitly widens its operand. e.g. a gep with a narrow
930 // index. So don't follow this use.
934 const SCEV *WideExpr = IsSigned ?
935 SE->getSignExtendExpr(NarrowExpr, WideType) :
936 SE->getZeroExtendExpr(NarrowExpr, WideType);
937 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(WideExpr);
938 if (!AddRec || AddRec->getLoop() != L)
943 /// This IV user cannot be widen. Replace this use of the original narrow IV
944 /// with a truncation of the new wide IV to isolate and eliminate the narrow IV.
945 static void truncateIVUse(NarrowIVDefUse DU, DominatorTree *DT) {
946 DEBUG(dbgs() << "INDVARS: Truncate IV " << *DU.WideDef
947 << " for user " << *DU.NarrowUse << "\n");
948 IRBuilder<> Builder(getInsertPointForUses(DU.NarrowUse, DU.NarrowDef, DT));
949 Value *Trunc = Builder.CreateTrunc(DU.WideDef, DU.NarrowDef->getType());
950 DU.NarrowUse->replaceUsesOfWith(DU.NarrowDef, Trunc);
953 /// If the narrow use is a compare instruction, then widen the compare
954 // (and possibly the other operand). The extend operation is hoisted into the
955 // loop preheader as far as possible.
956 bool WidenIV::WidenLoopCompare(NarrowIVDefUse DU) {
957 ICmpInst *Cmp = dyn_cast<ICmpInst>(DU.NarrowUse);
961 // Sign of IV user and compare must match.
962 if (IsSigned != CmpInst::isSigned(Cmp->getPredicate()))
965 Value *Op = Cmp->getOperand(Cmp->getOperand(0) == DU.NarrowDef ? 1 : 0);
966 unsigned CastWidth = SE->getTypeSizeInBits(Op->getType());
967 unsigned IVWidth = SE->getTypeSizeInBits(WideType);
968 assert (CastWidth <= IVWidth && "Unexpected width while widening compare.");
970 // Widen the compare instruction.
971 IRBuilder<> Builder(getInsertPointForUses(DU.NarrowUse, DU.NarrowDef, DT));
972 DU.NarrowUse->replaceUsesOfWith(DU.NarrowDef, DU.WideDef);
974 // Widen the other operand of the compare, if necessary.
975 if (CastWidth < IVWidth) {
976 Value *ExtOp = getExtend(Op, WideType, IsSigned, Cmp);
977 DU.NarrowUse->replaceUsesOfWith(Op, ExtOp);
982 /// WidenIVUse - Determine whether an individual user of the narrow IV can be
983 /// widened. If so, return the wide clone of the user.
984 Instruction *WidenIV::WidenIVUse(NarrowIVDefUse DU, SCEVExpander &Rewriter) {
986 // Stop traversing the def-use chain at inner-loop phis or post-loop phis.
987 if (PHINode *UsePhi = dyn_cast<PHINode>(DU.NarrowUse)) {
988 if (LI->getLoopFor(UsePhi->getParent()) != L) {
989 // For LCSSA phis, sink the truncate outside the loop.
990 // After SimplifyCFG most loop exit targets have a single predecessor.
991 // Otherwise fall back to a truncate within the loop.
992 if (UsePhi->getNumOperands() != 1)
993 truncateIVUse(DU, DT);
996 PHINode::Create(DU.WideDef->getType(), 1, UsePhi->getName() + ".wide",
998 WidePhi->addIncoming(DU.WideDef, UsePhi->getIncomingBlock(0));
999 IRBuilder<> Builder(WidePhi->getParent()->getFirstInsertionPt());
1000 Value *Trunc = Builder.CreateTrunc(WidePhi, DU.NarrowDef->getType());
1001 UsePhi->replaceAllUsesWith(Trunc);
1002 DeadInsts.push_back(UsePhi);
1003 DEBUG(dbgs() << "INDVARS: Widen lcssa phi " << *UsePhi
1004 << " to " << *WidePhi << "\n");
1009 // Our raison d'etre! Eliminate sign and zero extension.
1010 if (IsSigned ? isa<SExtInst>(DU.NarrowUse) : isa<ZExtInst>(DU.NarrowUse)) {
1011 Value *NewDef = DU.WideDef;
1012 if (DU.NarrowUse->getType() != WideType) {
1013 unsigned CastWidth = SE->getTypeSizeInBits(DU.NarrowUse->getType());
1014 unsigned IVWidth = SE->getTypeSizeInBits(WideType);
1015 if (CastWidth < IVWidth) {
1016 // The cast isn't as wide as the IV, so insert a Trunc.
1017 IRBuilder<> Builder(DU.NarrowUse);
1018 NewDef = Builder.CreateTrunc(DU.WideDef, DU.NarrowUse->getType());
1021 // A wider extend was hidden behind a narrower one. This may induce
1022 // another round of IV widening in which the intermediate IV becomes
1023 // dead. It should be very rare.
1024 DEBUG(dbgs() << "INDVARS: New IV " << *WidePhi
1025 << " not wide enough to subsume " << *DU.NarrowUse << "\n");
1026 DU.NarrowUse->replaceUsesOfWith(DU.NarrowDef, DU.WideDef);
1027 NewDef = DU.NarrowUse;
1030 if (NewDef != DU.NarrowUse) {
1031 DEBUG(dbgs() << "INDVARS: eliminating " << *DU.NarrowUse
1032 << " replaced by " << *DU.WideDef << "\n");
1034 DU.NarrowUse->replaceAllUsesWith(NewDef);
1035 DeadInsts.push_back(DU.NarrowUse);
1037 // Now that the extend is gone, we want to expose it's uses for potential
1038 // further simplification. We don't need to directly inform SimplifyIVUsers
1039 // of the new users, because their parent IV will be processed later as a
1040 // new loop phi. If we preserved IVUsers analysis, we would also want to
1041 // push the uses of WideDef here.
1043 // No further widening is needed. The deceased [sz]ext had done it for us.
1047 // Does this user itself evaluate to a recurrence after widening?
1048 const SCEVAddRecExpr *WideAddRec = GetWideRecurrence(DU.NarrowUse);
1050 WideAddRec = GetExtendedOperandRecurrence(DU);
1053 // If use is a loop condition, try to promote the condition instead of
1054 // truncating the IV first.
1055 if (WidenLoopCompare(DU))
1058 // This user does not evaluate to a recurence after widening, so don't
1059 // follow it. Instead insert a Trunc to kill off the original use,
1060 // eventually isolating the original narrow IV so it can be removed.
1061 truncateIVUse(DU, DT);
1064 // Assume block terminators cannot evaluate to a recurrence. We can't to
1065 // insert a Trunc after a terminator if there happens to be a critical edge.
1066 assert(DU.NarrowUse != DU.NarrowUse->getParent()->getTerminator() &&
1067 "SCEV is not expected to evaluate a block terminator");
1069 // Reuse the IV increment that SCEVExpander created as long as it dominates
1071 Instruction *WideUse = nullptr;
1072 if (WideAddRec == WideIncExpr
1073 && Rewriter.hoistIVInc(WideInc, DU.NarrowUse))
1076 WideUse = CloneIVUser(DU);
1080 // Evaluation of WideAddRec ensured that the narrow expression could be
1081 // extended outside the loop without overflow. This suggests that the wide use
1082 // evaluates to the same expression as the extended narrow use, but doesn't
1083 // absolutely guarantee it. Hence the following failsafe check. In rare cases
1084 // where it fails, we simply throw away the newly created wide use.
1085 if (WideAddRec != SE->getSCEV(WideUse)) {
1086 DEBUG(dbgs() << "Wide use expression mismatch: " << *WideUse
1087 << ": " << *SE->getSCEV(WideUse) << " != " << *WideAddRec << "\n");
1088 DeadInsts.push_back(WideUse);
1092 // Returning WideUse pushes it on the worklist.
1096 /// pushNarrowIVUsers - Add eligible users of NarrowDef to NarrowIVUsers.
1098 void WidenIV::pushNarrowIVUsers(Instruction *NarrowDef, Instruction *WideDef) {
1099 for (User *U : NarrowDef->users()) {
1100 Instruction *NarrowUser = cast<Instruction>(U);
1102 // Handle data flow merges and bizarre phi cycles.
1103 if (!Widened.insert(NarrowUser).second)
1106 NarrowIVUsers.push_back(NarrowIVDefUse(NarrowDef, NarrowUser, WideDef));
1110 /// CreateWideIV - Process a single induction variable. First use the
1111 /// SCEVExpander to create a wide induction variable that evaluates to the same
1112 /// recurrence as the original narrow IV. Then use a worklist to forward
1113 /// traverse the narrow IV's def-use chain. After WidenIVUse has processed all
1114 /// interesting IV users, the narrow IV will be isolated for removal by
1117 /// It would be simpler to delete uses as they are processed, but we must avoid
1118 /// invalidating SCEV expressions.
1120 PHINode *WidenIV::CreateWideIV(SCEVExpander &Rewriter) {
1121 // Is this phi an induction variable?
1122 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(SE->getSCEV(OrigPhi));
1126 // Widen the induction variable expression.
1127 const SCEV *WideIVExpr = IsSigned ?
1128 SE->getSignExtendExpr(AddRec, WideType) :
1129 SE->getZeroExtendExpr(AddRec, WideType);
1131 assert(SE->getEffectiveSCEVType(WideIVExpr->getType()) == WideType &&
1132 "Expect the new IV expression to preserve its type");
1134 // Can the IV be extended outside the loop without overflow?
1135 AddRec = dyn_cast<SCEVAddRecExpr>(WideIVExpr);
1136 if (!AddRec || AddRec->getLoop() != L)
1139 // An AddRec must have loop-invariant operands. Since this AddRec is
1140 // materialized by a loop header phi, the expression cannot have any post-loop
1141 // operands, so they must dominate the loop header.
1142 assert(SE->properlyDominates(AddRec->getStart(), L->getHeader()) &&
1143 SE->properlyDominates(AddRec->getStepRecurrence(*SE), L->getHeader())
1144 && "Loop header phi recurrence inputs do not dominate the loop");
1146 // The rewriter provides a value for the desired IV expression. This may
1147 // either find an existing phi or materialize a new one. Either way, we
1148 // expect a well-formed cyclic phi-with-increments. i.e. any operand not part
1149 // of the phi-SCC dominates the loop entry.
1150 Instruction *InsertPt = L->getHeader()->begin();
1151 WidePhi = cast<PHINode>(Rewriter.expandCodeFor(AddRec, WideType, InsertPt));
1153 // Remembering the WideIV increment generated by SCEVExpander allows
1154 // WidenIVUse to reuse it when widening the narrow IV's increment. We don't
1155 // employ a general reuse mechanism because the call above is the only call to
1156 // SCEVExpander. Henceforth, we produce 1-to-1 narrow to wide uses.
1157 if (BasicBlock *LatchBlock = L->getLoopLatch()) {
1159 cast<Instruction>(WidePhi->getIncomingValueForBlock(LatchBlock));
1160 WideIncExpr = SE->getSCEV(WideInc);
1163 DEBUG(dbgs() << "Wide IV: " << *WidePhi << "\n");
1166 // Traverse the def-use chain using a worklist starting at the original IV.
1167 assert(Widened.empty() && NarrowIVUsers.empty() && "expect initial state" );
1169 Widened.insert(OrigPhi);
1170 pushNarrowIVUsers(OrigPhi, WidePhi);
1172 while (!NarrowIVUsers.empty()) {
1173 NarrowIVDefUse DU = NarrowIVUsers.pop_back_val();
1175 // Process a def-use edge. This may replace the use, so don't hold a
1176 // use_iterator across it.
1177 Instruction *WideUse = WidenIVUse(DU, Rewriter);
1179 // Follow all def-use edges from the previous narrow use.
1181 pushNarrowIVUsers(DU.NarrowUse, WideUse);
1183 // WidenIVUse may have removed the def-use edge.
1184 if (DU.NarrowDef->use_empty())
1185 DeadInsts.push_back(DU.NarrowDef);
1190 //===----------------------------------------------------------------------===//
1191 // Live IV Reduction - Minimize IVs live across the loop.
1192 //===----------------------------------------------------------------------===//
1195 //===----------------------------------------------------------------------===//
1196 // Simplification of IV users based on SCEV evaluation.
1197 //===----------------------------------------------------------------------===//
1200 class IndVarSimplifyVisitor : public IVVisitor {
1201 ScalarEvolution *SE;
1202 const TargetTransformInfo *TTI;
1208 IndVarSimplifyVisitor(PHINode *IV, ScalarEvolution *SCEV,
1209 const TargetTransformInfo *TTI,
1210 const DominatorTree *DTree)
1211 : SE(SCEV), TTI(TTI), IVPhi(IV) {
1213 WI.NarrowIV = IVPhi;
1215 setSplitOverflowIntrinsics();
1218 // Implement the interface used by simplifyUsersOfIV.
1219 void visitCast(CastInst *Cast) override { visitIVCast(Cast, WI, SE, TTI); }
1223 /// SimplifyAndExtend - Iteratively perform simplification on a worklist of IV
1224 /// users. Each successive simplification may push more users which may
1225 /// themselves be candidates for simplification.
1227 /// Sign/Zero extend elimination is interleaved with IV simplification.
1229 void IndVarSimplify::SimplifyAndExtend(Loop *L,
1230 SCEVExpander &Rewriter,
1231 LPPassManager &LPM) {
1232 SmallVector<WideIVInfo, 8> WideIVs;
1234 SmallVector<PHINode*, 8> LoopPhis;
1235 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I) {
1236 LoopPhis.push_back(cast<PHINode>(I));
1238 // Each round of simplification iterates through the SimplifyIVUsers worklist
1239 // for all current phis, then determines whether any IVs can be
1240 // widened. Widening adds new phis to LoopPhis, inducing another round of
1241 // simplification on the wide IVs.
1242 while (!LoopPhis.empty()) {
1243 // Evaluate as many IV expressions as possible before widening any IVs. This
1244 // forces SCEV to set no-wrap flags before evaluating sign/zero
1245 // extension. The first time SCEV attempts to normalize sign/zero extension,
1246 // the result becomes final. So for the most predictable results, we delay
1247 // evaluation of sign/zero extend evaluation until needed, and avoid running
1248 // other SCEV based analysis prior to SimplifyAndExtend.
1250 PHINode *CurrIV = LoopPhis.pop_back_val();
1252 // Information about sign/zero extensions of CurrIV.
1253 IndVarSimplifyVisitor Visitor(CurrIV, SE, TTI, DT);
1255 Changed |= simplifyUsersOfIV(CurrIV, SE, &LPM, DeadInsts, &Visitor);
1257 if (Visitor.WI.WidestNativeType) {
1258 WideIVs.push_back(Visitor.WI);
1260 } while(!LoopPhis.empty());
1262 for (; !WideIVs.empty(); WideIVs.pop_back()) {
1263 WidenIV Widener(WideIVs.back(), LI, SE, DT, DeadInsts);
1264 if (PHINode *WidePhi = Widener.CreateWideIV(Rewriter)) {
1266 LoopPhis.push_back(WidePhi);
1272 //===----------------------------------------------------------------------===//
1273 // LinearFunctionTestReplace and its kin. Rewrite the loop exit condition.
1274 //===----------------------------------------------------------------------===//
1276 /// canExpandBackedgeTakenCount - Return true if this loop's backedge taken
1277 /// count expression can be safely and cheaply expanded into an instruction
1278 /// sequence that can be used by LinearFunctionTestReplace.
1280 /// TODO: This fails for pointer-type loop counters with greater than one byte
1281 /// strides, consequently preventing LFTR from running. For the purpose of LFTR
1282 /// we could skip this check in the case that the LFTR loop counter (chosen by
1283 /// FindLoopCounter) is also pointer type. Instead, we could directly convert
1284 /// the loop test to an inequality test by checking the target data's alignment
1285 /// of element types (given that the initial pointer value originates from or is
1286 /// used by ABI constrained operation, as opposed to inttoptr/ptrtoint).
1287 /// However, we don't yet have a strong motivation for converting loop tests
1288 /// into inequality tests.
1289 static bool canExpandBackedgeTakenCount(Loop *L, ScalarEvolution *SE,
1290 SCEVExpander &Rewriter) {
1291 const SCEV *BackedgeTakenCount = SE->getBackedgeTakenCount(L);
1292 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount) ||
1293 BackedgeTakenCount->isZero())
1296 if (!L->getExitingBlock())
1299 // Can't rewrite non-branch yet.
1300 if (!isa<BranchInst>(L->getExitingBlock()->getTerminator()))
1303 if (Rewriter.isHighCostExpansion(BackedgeTakenCount, L))
1309 /// getLoopPhiForCounter - Return the loop header phi IFF IncV adds a loop
1310 /// invariant value to the phi.
1311 static PHINode *getLoopPhiForCounter(Value *IncV, Loop *L, DominatorTree *DT) {
1312 Instruction *IncI = dyn_cast<Instruction>(IncV);
1316 switch (IncI->getOpcode()) {
1317 case Instruction::Add:
1318 case Instruction::Sub:
1320 case Instruction::GetElementPtr:
1321 // An IV counter must preserve its type.
1322 if (IncI->getNumOperands() == 2)
1328 PHINode *Phi = dyn_cast<PHINode>(IncI->getOperand(0));
1329 if (Phi && Phi->getParent() == L->getHeader()) {
1330 if (isLoopInvariant(IncI->getOperand(1), L, DT))
1334 if (IncI->getOpcode() == Instruction::GetElementPtr)
1337 // Allow add/sub to be commuted.
1338 Phi = dyn_cast<PHINode>(IncI->getOperand(1));
1339 if (Phi && Phi->getParent() == L->getHeader()) {
1340 if (isLoopInvariant(IncI->getOperand(0), L, DT))
1346 /// Return the compare guarding the loop latch, or NULL for unrecognized tests.
1347 static ICmpInst *getLoopTest(Loop *L) {
1348 assert(L->getExitingBlock() && "expected loop exit");
1350 BasicBlock *LatchBlock = L->getLoopLatch();
1351 // Don't bother with LFTR if the loop is not properly simplified.
1355 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator());
1356 assert(BI && "expected exit branch");
1358 return dyn_cast<ICmpInst>(BI->getCondition());
1361 /// needsLFTR - LinearFunctionTestReplace policy. Return true unless we can show
1362 /// that the current exit test is already sufficiently canonical.
1363 static bool needsLFTR(Loop *L, DominatorTree *DT) {
1364 // Do LFTR to simplify the exit condition to an ICMP.
1365 ICmpInst *Cond = getLoopTest(L);
1369 // Do LFTR to simplify the exit ICMP to EQ/NE
1370 ICmpInst::Predicate Pred = Cond->getPredicate();
1371 if (Pred != ICmpInst::ICMP_NE && Pred != ICmpInst::ICMP_EQ)
1374 // Look for a loop invariant RHS
1375 Value *LHS = Cond->getOperand(0);
1376 Value *RHS = Cond->getOperand(1);
1377 if (!isLoopInvariant(RHS, L, DT)) {
1378 if (!isLoopInvariant(LHS, L, DT))
1380 std::swap(LHS, RHS);
1382 // Look for a simple IV counter LHS
1383 PHINode *Phi = dyn_cast<PHINode>(LHS);
1385 Phi = getLoopPhiForCounter(LHS, L, DT);
1390 // Do LFTR if PHI node is defined in the loop, but is *not* a counter.
1391 int Idx = Phi->getBasicBlockIndex(L->getLoopLatch());
1395 // Do LFTR if the exit condition's IV is *not* a simple counter.
1396 Value *IncV = Phi->getIncomingValue(Idx);
1397 return Phi != getLoopPhiForCounter(IncV, L, DT);
1400 /// Recursive helper for hasConcreteDef(). Unfortunately, this currently boils
1401 /// down to checking that all operands are constant and listing instructions
1402 /// that may hide undef.
1403 static bool hasConcreteDefImpl(Value *V, SmallPtrSetImpl<Value*> &Visited,
1405 if (isa<Constant>(V))
1406 return !isa<UndefValue>(V);
1411 // Conservatively handle non-constant non-instructions. For example, Arguments
1413 Instruction *I = dyn_cast<Instruction>(V);
1417 // Load and return values may be undef.
1418 if(I->mayReadFromMemory() || isa<CallInst>(I) || isa<InvokeInst>(I))
1421 // Optimistically handle other instructions.
1422 for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI) {
1423 if (!Visited.insert(*OI).second)
1425 if (!hasConcreteDefImpl(*OI, Visited, Depth+1))
1431 /// Return true if the given value is concrete. We must prove that undef can
1434 /// TODO: If we decide that this is a good approach to checking for undef, we
1435 /// may factor it into a common location.
1436 static bool hasConcreteDef(Value *V) {
1437 SmallPtrSet<Value*, 8> Visited;
1439 return hasConcreteDefImpl(V, Visited, 0);
1442 /// AlmostDeadIV - Return true if this IV has any uses other than the (soon to
1443 /// be rewritten) loop exit test.
1444 static bool AlmostDeadIV(PHINode *Phi, BasicBlock *LatchBlock, Value *Cond) {
1445 int LatchIdx = Phi->getBasicBlockIndex(LatchBlock);
1446 Value *IncV = Phi->getIncomingValue(LatchIdx);
1448 for (User *U : Phi->users())
1449 if (U != Cond && U != IncV) return false;
1451 for (User *U : IncV->users())
1452 if (U != Cond && U != Phi) return false;
1456 /// FindLoopCounter - Find an affine IV in canonical form.
1458 /// BECount may be an i8* pointer type. The pointer difference is already
1459 /// valid count without scaling the address stride, so it remains a pointer
1460 /// expression as far as SCEV is concerned.
1462 /// Currently only valid for LFTR. See the comments on hasConcreteDef below.
1464 /// FIXME: Accept -1 stride and set IVLimit = IVInit - BECount
1466 /// FIXME: Accept non-unit stride as long as SCEV can reduce BECount * Stride.
1467 /// This is difficult in general for SCEV because of potential overflow. But we
1468 /// could at least handle constant BECounts.
1469 static PHINode *FindLoopCounter(Loop *L, const SCEV *BECount,
1470 ScalarEvolution *SE, DominatorTree *DT) {
1471 uint64_t BCWidth = SE->getTypeSizeInBits(BECount->getType());
1474 cast<BranchInst>(L->getExitingBlock()->getTerminator())->getCondition();
1476 // Loop over all of the PHI nodes, looking for a simple counter.
1477 PHINode *BestPhi = nullptr;
1478 const SCEV *BestInit = nullptr;
1479 BasicBlock *LatchBlock = L->getLoopLatch();
1480 assert(LatchBlock && "needsLFTR should guarantee a loop latch");
1482 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I) {
1483 PHINode *Phi = cast<PHINode>(I);
1484 if (!SE->isSCEVable(Phi->getType()))
1487 // Avoid comparing an integer IV against a pointer Limit.
1488 if (BECount->getType()->isPointerTy() && !Phi->getType()->isPointerTy())
1491 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(SE->getSCEV(Phi));
1492 if (!AR || AR->getLoop() != L || !AR->isAffine())
1495 // AR may be a pointer type, while BECount is an integer type.
1496 // AR may be wider than BECount. With eq/ne tests overflow is immaterial.
1497 // AR may not be a narrower type, or we may never exit.
1498 uint64_t PhiWidth = SE->getTypeSizeInBits(AR->getType());
1499 if (PhiWidth < BCWidth ||
1500 !L->getHeader()->getModule()->getDataLayout().isLegalInteger(PhiWidth))
1503 const SCEV *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE));
1504 if (!Step || !Step->isOne())
1507 int LatchIdx = Phi->getBasicBlockIndex(LatchBlock);
1508 Value *IncV = Phi->getIncomingValue(LatchIdx);
1509 if (getLoopPhiForCounter(IncV, L, DT) != Phi)
1512 // Avoid reusing a potentially undef value to compute other values that may
1513 // have originally had a concrete definition.
1514 if (!hasConcreteDef(Phi)) {
1515 // We explicitly allow unknown phis as long as they are already used by
1516 // the loop test. In this case we assume that performing LFTR could not
1517 // increase the number of undef users.
1518 if (ICmpInst *Cond = getLoopTest(L)) {
1519 if (Phi != getLoopPhiForCounter(Cond->getOperand(0), L, DT)
1520 && Phi != getLoopPhiForCounter(Cond->getOperand(1), L, DT)) {
1525 const SCEV *Init = AR->getStart();
1527 if (BestPhi && !AlmostDeadIV(BestPhi, LatchBlock, Cond)) {
1528 // Don't force a live loop counter if another IV can be used.
1529 if (AlmostDeadIV(Phi, LatchBlock, Cond))
1532 // Prefer to count-from-zero. This is a more "canonical" counter form. It
1533 // also prefers integer to pointer IVs.
1534 if (BestInit->isZero() != Init->isZero()) {
1535 if (BestInit->isZero())
1538 // If two IVs both count from zero or both count from nonzero then the
1539 // narrower is likely a dead phi that has been widened. Use the wider phi
1540 // to allow the other to be eliminated.
1541 else if (PhiWidth <= SE->getTypeSizeInBits(BestPhi->getType()))
1550 /// genLoopLimit - Help LinearFunctionTestReplace by generating a value that
1551 /// holds the RHS of the new loop test.
1552 static Value *genLoopLimit(PHINode *IndVar, const SCEV *IVCount, Loop *L,
1553 SCEVExpander &Rewriter, ScalarEvolution *SE) {
1554 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(SE->getSCEV(IndVar));
1555 assert(AR && AR->getLoop() == L && AR->isAffine() && "bad loop counter");
1556 const SCEV *IVInit = AR->getStart();
1558 // IVInit may be a pointer while IVCount is an integer when FindLoopCounter
1559 // finds a valid pointer IV. Sign extend BECount in order to materialize a
1560 // GEP. Avoid running SCEVExpander on a new pointer value, instead reusing
1561 // the existing GEPs whenever possible.
1562 if (IndVar->getType()->isPointerTy()
1563 && !IVCount->getType()->isPointerTy()) {
1565 // IVOffset will be the new GEP offset that is interpreted by GEP as a
1566 // signed value. IVCount on the other hand represents the loop trip count,
1567 // which is an unsigned value. FindLoopCounter only allows induction
1568 // variables that have a positive unit stride of one. This means we don't
1569 // have to handle the case of negative offsets (yet) and just need to zero
1571 Type *OfsTy = SE->getEffectiveSCEVType(IVInit->getType());
1572 const SCEV *IVOffset = SE->getTruncateOrZeroExtend(IVCount, OfsTy);
1574 // Expand the code for the iteration count.
1575 assert(SE->isLoopInvariant(IVOffset, L) &&
1576 "Computed iteration count is not loop invariant!");
1577 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator());
1578 Value *GEPOffset = Rewriter.expandCodeFor(IVOffset, OfsTy, BI);
1580 Value *GEPBase = IndVar->getIncomingValueForBlock(L->getLoopPreheader());
1581 assert(AR->getStart() == SE->getSCEV(GEPBase) && "bad loop counter");
1582 // We could handle pointer IVs other than i8*, but we need to compensate for
1583 // gep index scaling. See canExpandBackedgeTakenCount comments.
1584 assert(SE->getSizeOfExpr(IntegerType::getInt64Ty(IndVar->getContext()),
1585 cast<PointerType>(GEPBase->getType())->getElementType())->isOne()
1586 && "unit stride pointer IV must be i8*");
1588 IRBuilder<> Builder(L->getLoopPreheader()->getTerminator());
1589 return Builder.CreateGEP(nullptr, GEPBase, GEPOffset, "lftr.limit");
1592 // In any other case, convert both IVInit and IVCount to integers before
1593 // comparing. This may result in SCEV expension of pointers, but in practice
1594 // SCEV will fold the pointer arithmetic away as such:
1595 // BECount = (IVEnd - IVInit - 1) => IVLimit = IVInit (postinc).
1597 // Valid Cases: (1) both integers is most common; (2) both may be pointers
1598 // for simple memset-style loops.
1600 // IVInit integer and IVCount pointer would only occur if a canonical IV
1601 // were generated on top of case #2, which is not expected.
1603 const SCEV *IVLimit = nullptr;
1604 // For unit stride, IVCount = Start + BECount with 2's complement overflow.
1605 // For non-zero Start, compute IVCount here.
1606 if (AR->getStart()->isZero())
1609 assert(AR->getStepRecurrence(*SE)->isOne() && "only handles unit stride");
1610 const SCEV *IVInit = AR->getStart();
1612 // For integer IVs, truncate the IV before computing IVInit + BECount.
1613 if (SE->getTypeSizeInBits(IVInit->getType())
1614 > SE->getTypeSizeInBits(IVCount->getType()))
1615 IVInit = SE->getTruncateExpr(IVInit, IVCount->getType());
1617 IVLimit = SE->getAddExpr(IVInit, IVCount);
1619 // Expand the code for the iteration count.
1620 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator());
1621 IRBuilder<> Builder(BI);
1622 assert(SE->isLoopInvariant(IVLimit, L) &&
1623 "Computed iteration count is not loop invariant!");
1624 // Ensure that we generate the same type as IndVar, or a smaller integer
1625 // type. In the presence of null pointer values, we have an integer type
1626 // SCEV expression (IVInit) for a pointer type IV value (IndVar).
1627 Type *LimitTy = IVCount->getType()->isPointerTy() ?
1628 IndVar->getType() : IVCount->getType();
1629 return Rewriter.expandCodeFor(IVLimit, LimitTy, BI);
1633 /// LinearFunctionTestReplace - This method rewrites the exit condition of the
1634 /// loop to be a canonical != comparison against the incremented loop induction
1635 /// variable. This pass is able to rewrite the exit tests of any loop where the
1636 /// SCEV analysis can determine a loop-invariant trip count of the loop, which
1637 /// is actually a much broader range than just linear tests.
1638 Value *IndVarSimplify::
1639 LinearFunctionTestReplace(Loop *L,
1640 const SCEV *BackedgeTakenCount,
1642 SCEVExpander &Rewriter) {
1643 assert(canExpandBackedgeTakenCount(L, SE, Rewriter) && "precondition");
1645 // Initialize CmpIndVar and IVCount to their preincremented values.
1646 Value *CmpIndVar = IndVar;
1647 const SCEV *IVCount = BackedgeTakenCount;
1649 // If the exiting block is the same as the backedge block, we prefer to
1650 // compare against the post-incremented value, otherwise we must compare
1651 // against the preincremented value.
1652 if (L->getExitingBlock() == L->getLoopLatch()) {
1653 // Add one to the "backedge-taken" count to get the trip count.
1654 // This addition may overflow, which is valid as long as the comparison is
1655 // truncated to BackedgeTakenCount->getType().
1656 IVCount = SE->getAddExpr(BackedgeTakenCount,
1657 SE->getConstant(BackedgeTakenCount->getType(), 1));
1658 // The BackedgeTaken expression contains the number of times that the
1659 // backedge branches to the loop header. This is one less than the
1660 // number of times the loop executes, so use the incremented indvar.
1661 CmpIndVar = IndVar->getIncomingValueForBlock(L->getExitingBlock());
1664 Value *ExitCnt = genLoopLimit(IndVar, IVCount, L, Rewriter, SE);
1665 assert(ExitCnt->getType()->isPointerTy() == IndVar->getType()->isPointerTy()
1666 && "genLoopLimit missed a cast");
1668 // Insert a new icmp_ne or icmp_eq instruction before the branch.
1669 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator());
1670 ICmpInst::Predicate P;
1671 if (L->contains(BI->getSuccessor(0)))
1672 P = ICmpInst::ICMP_NE;
1674 P = ICmpInst::ICMP_EQ;
1676 DEBUG(dbgs() << "INDVARS: Rewriting loop exit condition to:\n"
1677 << " LHS:" << *CmpIndVar << '\n'
1679 << (P == ICmpInst::ICMP_NE ? "!=" : "==") << "\n"
1680 << " RHS:\t" << *ExitCnt << "\n"
1681 << " IVCount:\t" << *IVCount << "\n");
1683 IRBuilder<> Builder(BI);
1685 // LFTR can ignore IV overflow and truncate to the width of
1686 // BECount. This avoids materializing the add(zext(add)) expression.
1687 unsigned CmpIndVarSize = SE->getTypeSizeInBits(CmpIndVar->getType());
1688 unsigned ExitCntSize = SE->getTypeSizeInBits(ExitCnt->getType());
1689 if (CmpIndVarSize > ExitCntSize) {
1690 const SCEVAddRecExpr *AR = cast<SCEVAddRecExpr>(SE->getSCEV(IndVar));
1691 const SCEV *ARStart = AR->getStart();
1692 const SCEV *ARStep = AR->getStepRecurrence(*SE);
1693 // For constant IVCount, avoid truncation.
1694 if (isa<SCEVConstant>(ARStart) && isa<SCEVConstant>(IVCount)) {
1695 const APInt &Start = cast<SCEVConstant>(ARStart)->getValue()->getValue();
1696 APInt Count = cast<SCEVConstant>(IVCount)->getValue()->getValue();
1697 // Note that the post-inc value of BackedgeTakenCount may have overflowed
1698 // above such that IVCount is now zero.
1699 if (IVCount != BackedgeTakenCount && Count == 0) {
1700 Count = APInt::getMaxValue(Count.getBitWidth()).zext(CmpIndVarSize);
1704 Count = Count.zext(CmpIndVarSize);
1706 if (cast<SCEVConstant>(ARStep)->getValue()->isNegative())
1707 NewLimit = Start - Count;
1709 NewLimit = Start + Count;
1710 ExitCnt = ConstantInt::get(CmpIndVar->getType(), NewLimit);
1712 DEBUG(dbgs() << " Widen RHS:\t" << *ExitCnt << "\n");
1714 CmpIndVar = Builder.CreateTrunc(CmpIndVar, ExitCnt->getType(),
1718 Value *Cond = Builder.CreateICmp(P, CmpIndVar, ExitCnt, "exitcond");
1719 Value *OrigCond = BI->getCondition();
1720 // It's tempting to use replaceAllUsesWith here to fully replace the old
1721 // comparison, but that's not immediately safe, since users of the old
1722 // comparison may not be dominated by the new comparison. Instead, just
1723 // update the branch to use the new comparison; in the common case this
1724 // will make old comparison dead.
1725 BI->setCondition(Cond);
1726 DeadInsts.push_back(OrigCond);
1733 //===----------------------------------------------------------------------===//
1734 // SinkUnusedInvariants. A late subpass to cleanup loop preheaders.
1735 //===----------------------------------------------------------------------===//
1737 /// If there's a single exit block, sink any loop-invariant values that
1738 /// were defined in the preheader but not used inside the loop into the
1739 /// exit block to reduce register pressure in the loop.
1740 void IndVarSimplify::SinkUnusedInvariants(Loop *L) {
1741 BasicBlock *ExitBlock = L->getExitBlock();
1742 if (!ExitBlock) return;
1744 BasicBlock *Preheader = L->getLoopPreheader();
1745 if (!Preheader) return;
1747 Instruction *InsertPt = ExitBlock->getFirstInsertionPt();
1748 BasicBlock::iterator I = Preheader->getTerminator();
1749 while (I != Preheader->begin()) {
1751 // New instructions were inserted at the end of the preheader.
1752 if (isa<PHINode>(I))
1755 // Don't move instructions which might have side effects, since the side
1756 // effects need to complete before instructions inside the loop. Also don't
1757 // move instructions which might read memory, since the loop may modify
1758 // memory. Note that it's okay if the instruction might have undefined
1759 // behavior: LoopSimplify guarantees that the preheader dominates the exit
1761 if (I->mayHaveSideEffects() || I->mayReadFromMemory())
1764 // Skip debug info intrinsics.
1765 if (isa<DbgInfoIntrinsic>(I))
1768 // Skip landingpad instructions.
1769 if (isa<LandingPadInst>(I))
1772 // Don't sink alloca: we never want to sink static alloca's out of the
1773 // entry block, and correctly sinking dynamic alloca's requires
1774 // checks for stacksave/stackrestore intrinsics.
1775 // FIXME: Refactor this check somehow?
1776 if (isa<AllocaInst>(I))
1779 // Determine if there is a use in or before the loop (direct or
1781 bool UsedInLoop = false;
1782 for (Use &U : I->uses()) {
1783 Instruction *User = cast<Instruction>(U.getUser());
1784 BasicBlock *UseBB = User->getParent();
1785 if (PHINode *P = dyn_cast<PHINode>(User)) {
1787 PHINode::getIncomingValueNumForOperand(U.getOperandNo());
1788 UseBB = P->getIncomingBlock(i);
1790 if (UseBB == Preheader || L->contains(UseBB)) {
1796 // If there is, the def must remain in the preheader.
1800 // Otherwise, sink it to the exit block.
1801 Instruction *ToMove = I;
1804 if (I != Preheader->begin()) {
1805 // Skip debug info intrinsics.
1808 } while (isa<DbgInfoIntrinsic>(I) && I != Preheader->begin());
1810 if (isa<DbgInfoIntrinsic>(I) && I == Preheader->begin())
1816 ToMove->moveBefore(InsertPt);
1822 //===----------------------------------------------------------------------===//
1823 // IndVarSimplify driver. Manage several subpasses of IV simplification.
1824 //===----------------------------------------------------------------------===//
1826 bool IndVarSimplify::runOnLoop(Loop *L, LPPassManager &LPM) {
1827 if (skipOptnoneFunction(L))
1830 // If LoopSimplify form is not available, stay out of trouble. Some notes:
1831 // - LSR currently only supports LoopSimplify-form loops. Indvars'
1832 // canonicalization can be a pessimization without LSR to "clean up"
1834 // - We depend on having a preheader; in particular,
1835 // Loop::getCanonicalInductionVariable only supports loops with preheaders,
1836 // and we're in trouble if we can't find the induction variable even when
1837 // we've manually inserted one.
1838 if (!L->isLoopSimplifyForm())
1841 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
1842 SE = &getAnalysis<ScalarEvolution>();
1843 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
1844 auto *TLIP = getAnalysisIfAvailable<TargetLibraryInfoWrapperPass>();
1845 TLI = TLIP ? &TLIP->getTLI() : nullptr;
1846 auto *TTIP = getAnalysisIfAvailable<TargetTransformInfoWrapperPass>();
1847 TTI = TTIP ? &TTIP->getTTI(*L->getHeader()->getParent()) : nullptr;
1848 const DataLayout &DL = L->getHeader()->getModule()->getDataLayout();
1853 // If there are any floating-point recurrences, attempt to
1854 // transform them to use integer recurrences.
1855 RewriteNonIntegerIVs(L);
1857 const SCEV *BackedgeTakenCount = SE->getBackedgeTakenCount(L);
1859 // Create a rewriter object which we'll use to transform the code with.
1860 SCEVExpander Rewriter(*SE, DL, "indvars");
1862 Rewriter.setDebugType(DEBUG_TYPE);
1865 // Eliminate redundant IV users.
1867 // Simplification works best when run before other consumers of SCEV. We
1868 // attempt to avoid evaluating SCEVs for sign/zero extend operations until
1869 // other expressions involving loop IVs have been evaluated. This helps SCEV
1870 // set no-wrap flags before normalizing sign/zero extension.
1871 Rewriter.disableCanonicalMode();
1872 SimplifyAndExtend(L, Rewriter, LPM);
1874 // Check to see if this loop has a computable loop-invariant execution count.
1875 // If so, this means that we can compute the final value of any expressions
1876 // that are recurrent in the loop, and substitute the exit values from the
1877 // loop into any instructions outside of the loop that use the final values of
1878 // the current expressions.
1880 if (!isa<SCEVCouldNotCompute>(BackedgeTakenCount))
1881 RewriteLoopExitValues(L, Rewriter);
1883 // Eliminate redundant IV cycles.
1884 NumElimIV += Rewriter.replaceCongruentIVs(L, DT, DeadInsts);
1886 // If we have a trip count expression, rewrite the loop's exit condition
1887 // using it. We can currently only handle loops with a single exit.
1888 if (canExpandBackedgeTakenCount(L, SE, Rewriter) && needsLFTR(L, DT)) {
1889 PHINode *IndVar = FindLoopCounter(L, BackedgeTakenCount, SE, DT);
1891 // Check preconditions for proper SCEVExpander operation. SCEV does not
1892 // express SCEVExpander's dependencies, such as LoopSimplify. Instead any
1893 // pass that uses the SCEVExpander must do it. This does not work well for
1894 // loop passes because SCEVExpander makes assumptions about all loops,
1895 // while LoopPassManager only forces the current loop to be simplified.
1897 // FIXME: SCEV expansion has no way to bail out, so the caller must
1898 // explicitly check any assumptions made by SCEV. Brittle.
1899 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(BackedgeTakenCount);
1900 if (!AR || AR->getLoop()->getLoopPreheader())
1901 (void)LinearFunctionTestReplace(L, BackedgeTakenCount, IndVar,
1905 // Clear the rewriter cache, because values that are in the rewriter's cache
1906 // can be deleted in the loop below, causing the AssertingVH in the cache to
1910 // Now that we're done iterating through lists, clean up any instructions
1911 // which are now dead.
1912 while (!DeadInsts.empty())
1913 if (Instruction *Inst =
1914 dyn_cast_or_null<Instruction>(&*DeadInsts.pop_back_val()))
1915 RecursivelyDeleteTriviallyDeadInstructions(Inst, TLI);
1917 // The Rewriter may not be used from this point on.
1919 // Loop-invariant instructions in the preheader that aren't used in the
1920 // loop may be sunk below the loop to reduce register pressure.
1921 SinkUnusedInvariants(L);
1923 // Clean up dead instructions.
1924 Changed |= DeleteDeadPHIs(L->getHeader(), TLI);
1925 // Check a post-condition.
1926 assert(L->isLCSSAForm(*DT) &&
1927 "Indvars did not leave the loop in lcssa form!");
1929 // Verify that LFTR, and any other change have not interfered with SCEV's
1930 // ability to compute trip count.
1932 if (VerifyIndvars && !isa<SCEVCouldNotCompute>(BackedgeTakenCount)) {
1934 const SCEV *NewBECount = SE->getBackedgeTakenCount(L);
1935 if (SE->getTypeSizeInBits(BackedgeTakenCount->getType()) <
1936 SE->getTypeSizeInBits(NewBECount->getType()))
1937 NewBECount = SE->getTruncateOrNoop(NewBECount,
1938 BackedgeTakenCount->getType());
1940 BackedgeTakenCount = SE->getTruncateOrNoop(BackedgeTakenCount,
1941 NewBECount->getType());
1942 assert(BackedgeTakenCount == NewBECount && "indvars must preserve SCEV");