1 //===- LoopStrengthReduce.cpp - Strength Reduce IVs in Loops --------------===//
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 a strength reduction on array references inside loops that
11 // have as one or more of their components the loop induction variable.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "loop-reduce"
16 #include "llvm/Transforms/Scalar.h"
17 #include "llvm/Constants.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/IntrinsicInst.h"
20 #include "llvm/Type.h"
21 #include "llvm/DerivedTypes.h"
22 #include "llvm/Analysis/Dominators.h"
23 #include "llvm/Analysis/LoopInfo.h"
24 #include "llvm/Analysis/LoopPass.h"
25 #include "llvm/Analysis/ScalarEvolutionExpander.h"
26 #include "llvm/Transforms/Utils/AddrModeMatcher.h"
27 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
28 #include "llvm/Transforms/Utils/Local.h"
29 #include "llvm/Target/TargetData.h"
30 #include "llvm/ADT/SmallPtrSet.h"
31 #include "llvm/ADT/Statistic.h"
32 #include "llvm/Support/CFG.h"
33 #include "llvm/Support/Debug.h"
34 #include "llvm/Support/Compiler.h"
35 #include "llvm/Support/CommandLine.h"
36 #include "llvm/Target/TargetLowering.h"
40 STATISTIC(NumReduced , "Number of IV uses strength reduced");
41 STATISTIC(NumInserted, "Number of PHIs inserted");
42 STATISTIC(NumVariable, "Number of PHIs with variable strides");
43 STATISTIC(NumEliminated, "Number of strides eliminated");
44 STATISTIC(NumShadow, "Number of Shadow IVs optimized");
45 STATISTIC(NumImmSunk, "Number of common expr immediates sunk into uses");
47 static cl::opt<bool> EnableFullLSRMode("enable-full-lsr",
55 /// IVStrideUse - Keep track of one use of a strided induction variable, where
56 /// the stride is stored externally. The Offset member keeps track of the
57 /// offset from the IV, User is the actual user of the operand, and
58 /// 'OperandValToReplace' is the operand of the User that is the use.
59 struct VISIBILITY_HIDDEN IVStrideUse {
62 Value *OperandValToReplace;
64 // isUseOfPostIncrementedValue - True if this should use the
65 // post-incremented version of this IV, not the preincremented version.
66 // This can only be set in special cases, such as the terminating setcc
67 // instruction for a loop or uses dominated by the loop.
68 bool isUseOfPostIncrementedValue;
70 IVStrideUse(const SCEVHandle &Offs, Instruction *U, Value *O)
71 : Offset(Offs), User(U), OperandValToReplace(O),
72 isUseOfPostIncrementedValue(false) {}
75 /// IVUsersOfOneStride - This structure keeps track of all instructions that
76 /// have an operand that is based on the trip count multiplied by some stride.
77 /// The stride for all of these users is common and kept external to this
79 struct VISIBILITY_HIDDEN IVUsersOfOneStride {
80 /// Users - Keep track of all of the users of this stride as well as the
81 /// initial value and the operand that uses the IV.
82 std::vector<IVStrideUse> Users;
84 void addUser(const SCEVHandle &Offset,Instruction *User, Value *Operand) {
85 Users.push_back(IVStrideUse(Offset, User, Operand));
89 /// IVInfo - This structure keeps track of one IV expression inserted during
90 /// StrengthReduceStridedIVUsers. It contains the stride, the common base, as
91 /// well as the PHI node and increment value created for rewrite.
92 struct VISIBILITY_HIDDEN IVExpr {
97 IVExpr(const SCEVHandle &stride, const SCEVHandle &base, PHINode *phi)
98 : Stride(stride), Base(base), PHI(phi) {}
101 /// IVsOfOneStride - This structure keeps track of all IV expression inserted
102 /// during StrengthReduceStridedIVUsers for a particular stride of the IV.
103 struct VISIBILITY_HIDDEN IVsOfOneStride {
104 std::vector<IVExpr> IVs;
106 void addIV(const SCEVHandle &Stride, const SCEVHandle &Base, PHINode *PHI) {
107 IVs.push_back(IVExpr(Stride, Base, PHI));
111 class VISIBILITY_HIDDEN LoopStrengthReduce : public LoopPass {
115 const TargetData *TD;
116 const Type *UIntPtrTy;
119 /// IVUsesByStride - Keep track of all uses of induction variables that we
120 /// are interested in. The key of the map is the stride of the access.
121 std::map<SCEVHandle, IVUsersOfOneStride> IVUsesByStride;
123 /// IVsByStride - Keep track of all IVs that have been inserted for a
124 /// particular stride.
125 std::map<SCEVHandle, IVsOfOneStride> IVsByStride;
127 /// StrideOrder - An ordering of the keys in IVUsesByStride that is stable:
128 /// We use this to iterate over the IVUsesByStride collection without being
129 /// dependent on random ordering of pointers in the process.
130 SmallVector<SCEVHandle, 16> StrideOrder;
132 /// DeadInsts - Keep track of instructions we may have made dead, so that
133 /// we can remove them after we are done working.
134 SmallVector<Instruction*, 16> DeadInsts;
136 /// TLI - Keep a pointer of a TargetLowering to consult for determining
137 /// transformation profitability.
138 const TargetLowering *TLI;
141 static char ID; // Pass ID, replacement for typeid
142 explicit LoopStrengthReduce(const TargetLowering *tli = NULL) :
143 LoopPass(&ID), TLI(tli) {
146 bool runOnLoop(Loop *L, LPPassManager &LPM);
148 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
149 // We split critical edges, so we change the CFG. However, we do update
150 // many analyses if they are around.
151 AU.addPreservedID(LoopSimplifyID);
152 AU.addPreserved<LoopInfo>();
153 AU.addPreserved<DominanceFrontier>();
154 AU.addPreserved<DominatorTree>();
156 AU.addRequiredID(LoopSimplifyID);
157 AU.addRequired<LoopInfo>();
158 AU.addRequired<DominatorTree>();
159 AU.addRequired<TargetData>();
160 AU.addRequired<ScalarEvolution>();
161 AU.addPreserved<ScalarEvolution>();
165 bool AddUsersIfInteresting(Instruction *I, Loop *L,
166 SmallPtrSet<Instruction*,16> &Processed);
167 ICmpInst *ChangeCompareStride(Loop *L, ICmpInst *Cond,
168 IVStrideUse* &CondUse,
169 const SCEVHandle* &CondStride);
170 void OptimizeIndvars(Loop *L);
172 /// OptimizeShadowIV - If IV is used in a int-to-float cast
173 /// inside the loop then try to eliminate the cast opeation.
174 void OptimizeShadowIV(Loop *L);
176 /// OptimizeSMax - Rewrite the loop's terminating condition
177 /// if it uses an smax computation.
178 ICmpInst *OptimizeSMax(Loop *L, ICmpInst *Cond,
179 IVStrideUse* &CondUse);
181 bool FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse,
182 const SCEVHandle *&CondStride);
183 bool RequiresTypeConversion(const Type *Ty, const Type *NewTy);
184 SCEVHandle CheckForIVReuse(bool, bool, bool, const SCEVHandle&,
185 IVExpr&, const Type*,
186 const std::vector<BasedUser>& UsersToProcess);
187 bool ValidStride(bool, int64_t,
188 const std::vector<BasedUser>& UsersToProcess);
189 SCEVHandle CollectIVUsers(const SCEVHandle &Stride,
190 IVUsersOfOneStride &Uses,
192 bool &AllUsesAreAddresses,
193 bool &AllUsesAreOutsideLoop,
194 std::vector<BasedUser> &UsersToProcess);
195 bool ShouldUseFullStrengthReductionMode(
196 const std::vector<BasedUser> &UsersToProcess,
198 bool AllUsesAreAddresses,
200 void PrepareToStrengthReduceFully(
201 std::vector<BasedUser> &UsersToProcess,
203 SCEVHandle CommonExprs,
205 SCEVExpander &PreheaderRewriter);
206 void PrepareToStrengthReduceFromSmallerStride(
207 std::vector<BasedUser> &UsersToProcess,
209 const IVExpr &ReuseIV,
210 Instruction *PreInsertPt);
211 void PrepareToStrengthReduceWithNewPhi(
212 std::vector<BasedUser> &UsersToProcess,
214 SCEVHandle CommonExprs,
217 SCEVExpander &PreheaderRewriter);
218 void StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
219 IVUsersOfOneStride &Uses,
221 void DeleteTriviallyDeadInstructions();
225 char LoopStrengthReduce::ID = 0;
226 static RegisterPass<LoopStrengthReduce>
227 X("loop-reduce", "Loop Strength Reduction");
229 Pass *llvm::createLoopStrengthReducePass(const TargetLowering *TLI) {
230 return new LoopStrengthReduce(TLI);
233 /// DeleteTriviallyDeadInstructions - If any of the instructions is the
234 /// specified set are trivially dead, delete them and see if this makes any of
235 /// their operands subsequently dead.
236 void LoopStrengthReduce::DeleteTriviallyDeadInstructions() {
237 if (DeadInsts.empty()) return;
239 // Sort the deadinsts list so that we can trivially eliminate duplicates as we
240 // go. The code below never adds a non-dead instruction to the worklist, but
241 // callers may not be so careful.
242 array_pod_sort(DeadInsts.begin(), DeadInsts.end());
244 // Drop duplicate instructions and those with uses.
245 for (unsigned i = 0, e = DeadInsts.size()-1; i < e; ++i) {
246 Instruction *I = DeadInsts[i];
247 if (!I->use_empty()) DeadInsts[i] = 0;
248 while (i != e && DeadInsts[i+1] == I)
252 while (!DeadInsts.empty()) {
253 Instruction *I = DeadInsts.back();
254 DeadInsts.pop_back();
256 if (I == 0 || !isInstructionTriviallyDead(I))
259 SE->deleteValueFromRecords(I);
261 for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI) {
262 if (Instruction *U = dyn_cast<Instruction>(*OI)) {
265 DeadInsts.push_back(U);
269 I->eraseFromParent();
274 /// containsAddRecFromDifferentLoop - Determine whether expression S involves a
275 /// subexpression that is an AddRec from a loop other than L. An outer loop
276 /// of L is OK, but not an inner loop nor a disjoint loop.
277 static bool containsAddRecFromDifferentLoop(SCEVHandle S, Loop *L) {
278 // This is very common, put it first.
279 if (isa<SCEVConstant>(S))
281 if (SCEVCommutativeExpr *AE = dyn_cast<SCEVCommutativeExpr>(S)) {
282 for (unsigned int i=0; i< AE->getNumOperands(); i++)
283 if (containsAddRecFromDifferentLoop(AE->getOperand(i), L))
287 if (SCEVAddRecExpr *AE = dyn_cast<SCEVAddRecExpr>(S)) {
288 if (const Loop *newLoop = AE->getLoop()) {
291 // if newLoop is an outer loop of L, this is OK.
292 if (!LoopInfoBase<BasicBlock>::isNotAlreadyContainedIn(L, newLoop))
297 if (SCEVUDivExpr *DE = dyn_cast<SCEVUDivExpr>(S))
298 return containsAddRecFromDifferentLoop(DE->getLHS(), L) ||
299 containsAddRecFromDifferentLoop(DE->getRHS(), L);
301 // SCEVSDivExpr has been backed out temporarily, but will be back; we'll
302 // need this when it is.
303 if (SCEVSDivExpr *DE = dyn_cast<SCEVSDivExpr>(S))
304 return containsAddRecFromDifferentLoop(DE->getLHS(), L) ||
305 containsAddRecFromDifferentLoop(DE->getRHS(), L);
307 if (SCEVTruncateExpr *TE = dyn_cast<SCEVTruncateExpr>(S))
308 return containsAddRecFromDifferentLoop(TE->getOperand(), L);
309 if (SCEVZeroExtendExpr *ZE = dyn_cast<SCEVZeroExtendExpr>(S))
310 return containsAddRecFromDifferentLoop(ZE->getOperand(), L);
311 if (SCEVSignExtendExpr *SE = dyn_cast<SCEVSignExtendExpr>(S))
312 return containsAddRecFromDifferentLoop(SE->getOperand(), L);
316 /// getSCEVStartAndStride - Compute the start and stride of this expression,
317 /// returning false if the expression is not a start/stride pair, or true if it
318 /// is. The stride must be a loop invariant expression, but the start may be
319 /// a mix of loop invariant and loop variant expressions. The start cannot,
320 /// however, contain an AddRec from a different loop, unless that loop is an
321 /// outer loop of the current loop.
322 static bool getSCEVStartAndStride(const SCEVHandle &SH, Loop *L,
323 SCEVHandle &Start, SCEVHandle &Stride,
324 ScalarEvolution *SE, DominatorTree *DT) {
325 SCEVHandle TheAddRec = Start; // Initialize to zero.
327 // If the outer level is an AddExpr, the operands are all start values except
328 // for a nested AddRecExpr.
329 if (SCEVAddExpr *AE = dyn_cast<SCEVAddExpr>(SH)) {
330 for (unsigned i = 0, e = AE->getNumOperands(); i != e; ++i)
331 if (SCEVAddRecExpr *AddRec =
332 dyn_cast<SCEVAddRecExpr>(AE->getOperand(i))) {
333 if (AddRec->getLoop() == L)
334 TheAddRec = SE->getAddExpr(AddRec, TheAddRec);
336 return false; // Nested IV of some sort?
338 Start = SE->getAddExpr(Start, AE->getOperand(i));
341 } else if (isa<SCEVAddRecExpr>(SH)) {
344 return false; // not analyzable.
347 SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(TheAddRec);
348 if (!AddRec || AddRec->getLoop() != L) return false;
350 // FIXME: Generalize to non-affine IV's.
351 if (!AddRec->isAffine()) return false;
353 // If Start contains an SCEVAddRecExpr from a different loop, other than an
354 // outer loop of the current loop, reject it. SCEV has no concept of
355 // operating on more than one loop at a time so don't confuse it with such
357 if (containsAddRecFromDifferentLoop(AddRec->getOperand(0), L))
360 Start = SE->getAddExpr(Start, AddRec->getOperand(0));
362 if (!isa<SCEVConstant>(AddRec->getOperand(1))) {
363 // If stride is an instruction, make sure it dominates the loop preheader.
364 // Otherwise we could end up with a use before def situation.
365 BasicBlock *Preheader = L->getLoopPreheader();
366 if (!AddRec->getOperand(1)->dominates(Preheader, DT))
369 DOUT << "[" << L->getHeader()->getName()
370 << "] Variable stride: " << *AddRec << "\n";
373 Stride = AddRec->getOperand(1);
377 /// IVUseShouldUsePostIncValue - We have discovered a "User" of an IV expression
378 /// and now we need to decide whether the user should use the preinc or post-inc
379 /// value. If this user should use the post-inc version of the IV, return true.
381 /// Choosing wrong here can break dominance properties (if we choose to use the
382 /// post-inc value when we cannot) or it can end up adding extra live-ranges to
383 /// the loop, resulting in reg-reg copies (if we use the pre-inc value when we
384 /// should use the post-inc value).
385 static bool IVUseShouldUsePostIncValue(Instruction *User, Instruction *IV,
386 Loop *L, DominatorTree *DT, Pass *P,
387 SmallVectorImpl<Instruction*> &DeadInsts){
388 // If the user is in the loop, use the preinc value.
389 if (L->contains(User->getParent())) return false;
391 BasicBlock *LatchBlock = L->getLoopLatch();
393 // Ok, the user is outside of the loop. If it is dominated by the latch
394 // block, use the post-inc value.
395 if (DT->dominates(LatchBlock, User->getParent()))
398 // There is one case we have to be careful of: PHI nodes. These little guys
399 // can live in blocks that do not dominate the latch block, but (since their
400 // uses occur in the predecessor block, not the block the PHI lives in) should
401 // still use the post-inc value. Check for this case now.
402 PHINode *PN = dyn_cast<PHINode>(User);
403 if (!PN) return false; // not a phi, not dominated by latch block.
405 // Look at all of the uses of IV by the PHI node. If any use corresponds to
406 // a block that is not dominated by the latch block, give up and use the
407 // preincremented value.
408 unsigned NumUses = 0;
409 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
410 if (PN->getIncomingValue(i) == IV) {
412 if (!DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
416 // Okay, all uses of IV by PN are in predecessor blocks that really are
417 // dominated by the latch block. Split the critical edges and use the
418 // post-incremented value.
419 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
420 if (PN->getIncomingValue(i) == IV) {
421 SplitCriticalEdge(PN->getIncomingBlock(i), PN->getParent(), P, false);
422 // Splitting the critical edge can reduce the number of entries in this
424 e = PN->getNumIncomingValues();
425 if (--NumUses == 0) break;
428 // PHI node might have become a constant value after SplitCriticalEdge.
429 DeadInsts.push_back(User);
434 /// isAddressUse - Returns true if the specified instruction is using the
435 /// specified value as an address.
436 static bool isAddressUse(Instruction *Inst, Value *OperandVal) {
437 bool isAddress = isa<LoadInst>(Inst);
438 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
439 if (SI->getOperand(1) == OperandVal)
441 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
442 // Addressing modes can also be folded into prefetches and a variety
444 switch (II->getIntrinsicID()) {
446 case Intrinsic::prefetch:
447 case Intrinsic::x86_sse2_loadu_dq:
448 case Intrinsic::x86_sse2_loadu_pd:
449 case Intrinsic::x86_sse_loadu_ps:
450 case Intrinsic::x86_sse_storeu_ps:
451 case Intrinsic::x86_sse2_storeu_pd:
452 case Intrinsic::x86_sse2_storeu_dq:
453 case Intrinsic::x86_sse2_storel_dq:
454 if (II->getOperand(1) == OperandVal)
462 /// getAccessType - Return the type of the memory being accessed.
463 static const Type *getAccessType(const Instruction *Inst) {
464 const Type *UseTy = Inst->getType();
465 if (const StoreInst *SI = dyn_cast<StoreInst>(Inst))
466 UseTy = SI->getOperand(0)->getType();
467 else if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
468 // Addressing modes can also be folded into prefetches and a variety
470 switch (II->getIntrinsicID()) {
472 case Intrinsic::x86_sse_storeu_ps:
473 case Intrinsic::x86_sse2_storeu_pd:
474 case Intrinsic::x86_sse2_storeu_dq:
475 case Intrinsic::x86_sse2_storel_dq:
476 UseTy = II->getOperand(1)->getType();
483 /// AddUsersIfInteresting - Inspect the specified instruction. If it is a
484 /// reducible SCEV, recursively add its users to the IVUsesByStride set and
485 /// return true. Otherwise, return false.
486 bool LoopStrengthReduce::AddUsersIfInteresting(Instruction *I, Loop *L,
487 SmallPtrSet<Instruction*,16> &Processed) {
488 if (!I->getType()->isInteger() && !isa<PointerType>(I->getType()))
489 return false; // Void and FP expressions cannot be reduced.
491 // LSR is not APInt clean, do not touch integers bigger than 64-bits.
492 if (TD->getTypeSizeInBits(I->getType()) > 64)
495 if (!Processed.insert(I))
496 return true; // Instruction already handled.
498 // Get the symbolic expression for this instruction.
499 SCEVHandle ISE = SE->getSCEV(I);
500 if (isa<SCEVCouldNotCompute>(ISE)) return false;
502 // Get the start and stride for this expression.
503 SCEVHandle Start = SE->getIntegerSCEV(0, ISE->getType());
504 SCEVHandle Stride = Start;
505 if (!getSCEVStartAndStride(ISE, L, Start, Stride, SE, DT))
506 return false; // Non-reducible symbolic expression, bail out.
508 std::vector<Instruction *> IUsers;
509 // Collect all I uses now because IVUseShouldUsePostIncValue may
510 // invalidate use_iterator.
511 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
512 IUsers.push_back(cast<Instruction>(*UI));
514 for (unsigned iused_index = 0, iused_size = IUsers.size();
515 iused_index != iused_size; ++iused_index) {
517 Instruction *User = IUsers[iused_index];
519 // Do not infinitely recurse on PHI nodes.
520 if (isa<PHINode>(User) && Processed.count(User))
523 // Descend recursively, but not into PHI nodes outside the current loop.
524 // It's important to see the entire expression outside the loop to get
525 // choices that depend on addressing mode use right, although we won't
526 // consider references ouside the loop in all cases.
527 // If User is already in Processed, we don't want to recurse into it again,
528 // but do want to record a second reference in the same instruction.
529 bool AddUserToIVUsers = false;
530 if (LI->getLoopFor(User->getParent()) != L) {
531 if (isa<PHINode>(User) || Processed.count(User) ||
532 !AddUsersIfInteresting(User, L, Processed)) {
533 DOUT << "FOUND USER in other loop: " << *User
534 << " OF SCEV: " << *ISE << "\n";
535 AddUserToIVUsers = true;
537 } else if (Processed.count(User) ||
538 !AddUsersIfInteresting(User, L, Processed)) {
539 DOUT << "FOUND USER: " << *User
540 << " OF SCEV: " << *ISE << "\n";
541 AddUserToIVUsers = true;
544 if (AddUserToIVUsers) {
545 IVUsersOfOneStride &StrideUses = IVUsesByStride[Stride];
546 if (StrideUses.Users.empty()) // First occurrence of this stride?
547 StrideOrder.push_back(Stride);
549 // Okay, we found a user that we cannot reduce. Analyze the instruction
550 // and decide what to do with it. If we are a use inside of the loop, use
551 // the value before incrementation, otherwise use it after incrementation.
552 if (IVUseShouldUsePostIncValue(User, I, L, DT, this, DeadInsts)) {
553 // The value used will be incremented by the stride more than we are
554 // expecting, so subtract this off.
555 SCEVHandle NewStart = SE->getMinusSCEV(Start, Stride);
556 StrideUses.addUser(NewStart, User, I);
557 StrideUses.Users.back().isUseOfPostIncrementedValue = true;
558 DOUT << " USING POSTINC SCEV, START=" << *NewStart<< "\n";
560 StrideUses.addUser(Start, User, I);
568 /// BasedUser - For a particular base value, keep information about how we've
569 /// partitioned the expression so far.
571 /// SE - The current ScalarEvolution object.
574 /// Base - The Base value for the PHI node that needs to be inserted for
575 /// this use. As the use is processed, information gets moved from this
576 /// field to the Imm field (below). BasedUser values are sorted by this
580 /// Inst - The instruction using the induction variable.
583 /// OperandValToReplace - The operand value of Inst to replace with the
585 Value *OperandValToReplace;
587 /// Imm - The immediate value that should be added to the base immediately
588 /// before Inst, because it will be folded into the imm field of the
589 /// instruction. This is also sometimes used for loop-variant values that
590 /// must be added inside the loop.
593 /// Phi - The induction variable that performs the striding that
594 /// should be used for this user.
597 // isUseOfPostIncrementedValue - True if this should use the
598 // post-incremented version of this IV, not the preincremented version.
599 // This can only be set in special cases, such as the terminating setcc
600 // instruction for a loop and uses outside the loop that are dominated by
602 bool isUseOfPostIncrementedValue;
604 BasedUser(IVStrideUse &IVSU, ScalarEvolution *se)
605 : SE(se), Base(IVSU.Offset), Inst(IVSU.User),
606 OperandValToReplace(IVSU.OperandValToReplace),
607 Imm(SE->getIntegerSCEV(0, Base->getType())),
608 isUseOfPostIncrementedValue(IVSU.isUseOfPostIncrementedValue) {}
610 // Once we rewrite the code to insert the new IVs we want, update the
611 // operands of Inst to use the new expression 'NewBase', with 'Imm' added
613 void RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
614 Instruction *InsertPt,
615 SCEVExpander &Rewriter, Loop *L, Pass *P,
616 SmallVectorImpl<Instruction*> &DeadInsts);
618 Value *InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
620 SCEVExpander &Rewriter,
621 Instruction *IP, Loop *L);
626 void BasedUser::dump() const {
627 cerr << " Base=" << *Base;
628 cerr << " Imm=" << *Imm;
629 cerr << " Inst: " << *Inst;
632 Value *BasedUser::InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
634 SCEVExpander &Rewriter,
635 Instruction *IP, Loop *L) {
636 // Figure out where we *really* want to insert this code. In particular, if
637 // the user is inside of a loop that is nested inside of L, we really don't
638 // want to insert this expression before the user, we'd rather pull it out as
639 // many loops as possible.
640 LoopInfo &LI = Rewriter.getLoopInfo();
641 Instruction *BaseInsertPt = IP;
643 // Figure out the most-nested loop that IP is in.
644 Loop *InsertLoop = LI.getLoopFor(IP->getParent());
646 // If InsertLoop is not L, and InsertLoop is nested inside of L, figure out
647 // the preheader of the outer-most loop where NewBase is not loop invariant.
648 if (L->contains(IP->getParent()))
649 while (InsertLoop && NewBase->isLoopInvariant(InsertLoop)) {
650 BaseInsertPt = InsertLoop->getLoopPreheader()->getTerminator();
651 InsertLoop = InsertLoop->getParentLoop();
654 Value *Base = Rewriter.expandCodeFor(NewBase, Ty, BaseInsertPt);
656 // If there is no immediate value, skip the next part.
660 // If we are inserting the base and imm values in the same block, make sure to
661 // adjust the IP position if insertion reused a result.
662 if (IP == BaseInsertPt)
663 IP = Rewriter.getInsertionPoint();
665 // Always emit the immediate (if non-zero) into the same block as the user.
666 SCEVHandle NewValSCEV = SE->getAddExpr(SE->getUnknown(Base), Imm);
667 return Rewriter.expandCodeFor(NewValSCEV, Ty, IP);
671 // Once we rewrite the code to insert the new IVs we want, update the
672 // operands of Inst to use the new expression 'NewBase', with 'Imm' added
673 // to it. NewBasePt is the last instruction which contributes to the
674 // value of NewBase in the case that it's a diffferent instruction from
675 // the PHI that NewBase is computed from, or null otherwise.
677 void BasedUser::RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
678 Instruction *NewBasePt,
679 SCEVExpander &Rewriter, Loop *L, Pass *P,
680 SmallVectorImpl<Instruction*> &DeadInsts){
681 if (!isa<PHINode>(Inst)) {
682 // By default, insert code at the user instruction.
683 BasicBlock::iterator InsertPt = Inst;
685 // However, if the Operand is itself an instruction, the (potentially
686 // complex) inserted code may be shared by many users. Because of this, we
687 // want to emit code for the computation of the operand right before its old
688 // computation. This is usually safe, because we obviously used to use the
689 // computation when it was computed in its current block. However, in some
690 // cases (e.g. use of a post-incremented induction variable) the NewBase
691 // value will be pinned to live somewhere after the original computation.
692 // In this case, we have to back off.
694 // If this is a use outside the loop (which means after, since it is based
695 // on a loop indvar) we use the post-incremented value, so that we don't
696 // artificially make the preinc value live out the bottom of the loop.
697 if (!isUseOfPostIncrementedValue && L->contains(Inst->getParent())) {
698 if (NewBasePt && isa<PHINode>(OperandValToReplace)) {
699 InsertPt = NewBasePt;
701 } else if (Instruction *OpInst
702 = dyn_cast<Instruction>(OperandValToReplace)) {
704 while (isa<PHINode>(InsertPt)) ++InsertPt;
707 Value *NewVal = InsertCodeForBaseAtPosition(NewBase,
708 OperandValToReplace->getType(),
709 Rewriter, InsertPt, L);
710 // Replace the use of the operand Value with the new Phi we just created.
711 Inst->replaceUsesOfWith(OperandValToReplace, NewVal);
713 DOUT << " Replacing with ";
714 DEBUG(WriteAsOperand(*DOUT, NewVal, /*PrintType=*/false));
715 DOUT << ", which has value " << *NewBase << " plus IMM " << *Imm << "\n";
719 // PHI nodes are more complex. We have to insert one copy of the NewBase+Imm
720 // expression into each operand block that uses it. Note that PHI nodes can
721 // have multiple entries for the same predecessor. We use a map to make sure
722 // that a PHI node only has a single Value* for each predecessor (which also
723 // prevents us from inserting duplicate code in some blocks).
724 DenseMap<BasicBlock*, Value*> InsertedCode;
725 PHINode *PN = cast<PHINode>(Inst);
726 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
727 if (PN->getIncomingValue(i) == OperandValToReplace) {
728 // If the original expression is outside the loop, put the replacement
729 // code in the same place as the original expression,
730 // which need not be an immediate predecessor of this PHI. This way we
731 // need only one copy of it even if it is referenced multiple times in
732 // the PHI. We don't do this when the original expression is inside the
733 // loop because multiple copies sometimes do useful sinking of code in
735 Instruction *OldLoc = dyn_cast<Instruction>(OperandValToReplace);
736 if (L->contains(OldLoc->getParent())) {
737 // If this is a critical edge, split the edge so that we do not insert
738 // the code on all predecessor/successor paths. We do this unless this
739 // is the canonical backedge for this loop, as this can make some
740 // inserted code be in an illegal position.
741 BasicBlock *PHIPred = PN->getIncomingBlock(i);
742 if (e != 1 && PHIPred->getTerminator()->getNumSuccessors() > 1 &&
743 (PN->getParent() != L->getHeader() || !L->contains(PHIPred))) {
745 // First step, split the critical edge.
746 SplitCriticalEdge(PHIPred, PN->getParent(), P, false);
748 // Next step: move the basic block. In particular, if the PHI node
749 // is outside of the loop, and PredTI is in the loop, we want to
750 // move the block to be immediately before the PHI block, not
751 // immediately after PredTI.
752 if (L->contains(PHIPred) && !L->contains(PN->getParent())) {
753 BasicBlock *NewBB = PN->getIncomingBlock(i);
754 NewBB->moveBefore(PN->getParent());
757 // Splitting the edge can reduce the number of PHI entries we have.
758 e = PN->getNumIncomingValues();
761 Value *&Code = InsertedCode[PN->getIncomingBlock(i)];
763 // Insert the code into the end of the predecessor block.
764 Instruction *InsertPt = (L->contains(OldLoc->getParent())) ?
765 PN->getIncomingBlock(i)->getTerminator() :
766 OldLoc->getParent()->getTerminator();
767 Code = InsertCodeForBaseAtPosition(NewBase, PN->getType(),
768 Rewriter, InsertPt, L);
770 DOUT << " Changing PHI use to ";
771 DEBUG(WriteAsOperand(*DOUT, Code, /*PrintType=*/false));
772 DOUT << ", which has value " << *NewBase << " plus IMM " << *Imm << "\n";
775 // Replace the use of the operand Value with the new Phi we just created.
776 PN->setIncomingValue(i, Code);
781 // PHI node might have become a constant value after SplitCriticalEdge.
782 DeadInsts.push_back(Inst);
786 /// fitsInAddressMode - Return true if V can be subsumed within an addressing
787 /// mode, and does not need to be put in a register first.
788 static bool fitsInAddressMode(const SCEVHandle &V, const Type *UseTy,
789 const TargetLowering *TLI, bool HasBaseReg) {
790 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(V)) {
791 int64_t VC = SC->getValue()->getSExtValue();
793 TargetLowering::AddrMode AM;
795 AM.HasBaseReg = HasBaseReg;
796 return TLI->isLegalAddressingMode(AM, UseTy);
798 // Defaults to PPC. PPC allows a sign-extended 16-bit immediate field.
799 return (VC > -(1 << 16) && VC < (1 << 16)-1);
803 if (SCEVUnknown *SU = dyn_cast<SCEVUnknown>(V))
804 if (GlobalValue *GV = dyn_cast<GlobalValue>(SU->getValue())) {
805 TargetLowering::AddrMode AM;
807 AM.HasBaseReg = HasBaseReg;
808 return TLI->isLegalAddressingMode(AM, UseTy);
814 /// MoveLoopVariantsToImmediateField - Move any subexpressions from Val that are
815 /// loop varying to the Imm operand.
816 static void MoveLoopVariantsToImmediateField(SCEVHandle &Val, SCEVHandle &Imm,
817 Loop *L, ScalarEvolution *SE) {
818 if (Val->isLoopInvariant(L)) return; // Nothing to do.
820 if (SCEVAddExpr *SAE = dyn_cast<SCEVAddExpr>(Val)) {
821 std::vector<SCEVHandle> NewOps;
822 NewOps.reserve(SAE->getNumOperands());
824 for (unsigned i = 0; i != SAE->getNumOperands(); ++i)
825 if (!SAE->getOperand(i)->isLoopInvariant(L)) {
826 // If this is a loop-variant expression, it must stay in the immediate
827 // field of the expression.
828 Imm = SE->getAddExpr(Imm, SAE->getOperand(i));
830 NewOps.push_back(SAE->getOperand(i));
834 Val = SE->getIntegerSCEV(0, Val->getType());
836 Val = SE->getAddExpr(NewOps);
837 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Val)) {
838 // Try to pull immediates out of the start value of nested addrec's.
839 SCEVHandle Start = SARE->getStart();
840 MoveLoopVariantsToImmediateField(Start, Imm, L, SE);
842 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
844 Val = SE->getAddRecExpr(Ops, SARE->getLoop());
846 // Otherwise, all of Val is variant, move the whole thing over.
847 Imm = SE->getAddExpr(Imm, Val);
848 Val = SE->getIntegerSCEV(0, Val->getType());
853 /// MoveImmediateValues - Look at Val, and pull out any additions of constants
854 /// that can fit into the immediate field of instructions in the target.
855 /// Accumulate these immediate values into the Imm value.
856 static void MoveImmediateValues(const TargetLowering *TLI,
858 SCEVHandle &Val, SCEVHandle &Imm,
859 bool isAddress, Loop *L,
860 ScalarEvolution *SE) {
861 if (SCEVAddExpr *SAE = dyn_cast<SCEVAddExpr>(Val)) {
862 std::vector<SCEVHandle> NewOps;
863 NewOps.reserve(SAE->getNumOperands());
865 for (unsigned i = 0; i != SAE->getNumOperands(); ++i) {
866 SCEVHandle NewOp = SAE->getOperand(i);
867 MoveImmediateValues(TLI, UseTy, NewOp, Imm, isAddress, L, SE);
869 if (!NewOp->isLoopInvariant(L)) {
870 // If this is a loop-variant expression, it must stay in the immediate
871 // field of the expression.
872 Imm = SE->getAddExpr(Imm, NewOp);
874 NewOps.push_back(NewOp);
879 Val = SE->getIntegerSCEV(0, Val->getType());
881 Val = SE->getAddExpr(NewOps);
883 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Val)) {
884 // Try to pull immediates out of the start value of nested addrec's.
885 SCEVHandle Start = SARE->getStart();
886 MoveImmediateValues(TLI, UseTy, Start, Imm, isAddress, L, SE);
888 if (Start != SARE->getStart()) {
889 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
891 Val = SE->getAddRecExpr(Ops, SARE->getLoop());
894 } else if (SCEVMulExpr *SME = dyn_cast<SCEVMulExpr>(Val)) {
895 // Transform "8 * (4 + v)" -> "32 + 8*V" if "32" fits in the immed field.
896 if (isAddress && fitsInAddressMode(SME->getOperand(0), UseTy, TLI, false) &&
897 SME->getNumOperands() == 2 && SME->isLoopInvariant(L)) {
899 SCEVHandle SubImm = SE->getIntegerSCEV(0, Val->getType());
900 SCEVHandle NewOp = SME->getOperand(1);
901 MoveImmediateValues(TLI, UseTy, NewOp, SubImm, isAddress, L, SE);
903 // If we extracted something out of the subexpressions, see if we can
905 if (NewOp != SME->getOperand(1)) {
906 // Scale SubImm up by "8". If the result is a target constant, we are
908 SubImm = SE->getMulExpr(SubImm, SME->getOperand(0));
909 if (fitsInAddressMode(SubImm, UseTy, TLI, false)) {
910 // Accumulate the immediate.
911 Imm = SE->getAddExpr(Imm, SubImm);
913 // Update what is left of 'Val'.
914 Val = SE->getMulExpr(SME->getOperand(0), NewOp);
921 // Loop-variant expressions must stay in the immediate field of the
923 if ((isAddress && fitsInAddressMode(Val, UseTy, TLI, false)) ||
924 !Val->isLoopInvariant(L)) {
925 Imm = SE->getAddExpr(Imm, Val);
926 Val = SE->getIntegerSCEV(0, Val->getType());
930 // Otherwise, no immediates to move.
933 static void MoveImmediateValues(const TargetLowering *TLI,
935 SCEVHandle &Val, SCEVHandle &Imm,
936 bool isAddress, Loop *L,
937 ScalarEvolution *SE) {
938 const Type *UseTy = getAccessType(User);
939 MoveImmediateValues(TLI, UseTy, Val, Imm, isAddress, L, SE);
942 /// SeparateSubExprs - Decompose Expr into all of the subexpressions that are
943 /// added together. This is used to reassociate common addition subexprs
944 /// together for maximal sharing when rewriting bases.
945 static void SeparateSubExprs(std::vector<SCEVHandle> &SubExprs,
947 ScalarEvolution *SE) {
948 if (SCEVAddExpr *AE = dyn_cast<SCEVAddExpr>(Expr)) {
949 for (unsigned j = 0, e = AE->getNumOperands(); j != e; ++j)
950 SeparateSubExprs(SubExprs, AE->getOperand(j), SE);
951 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Expr)) {
952 SCEVHandle Zero = SE->getIntegerSCEV(0, Expr->getType());
953 if (SARE->getOperand(0) == Zero) {
954 SubExprs.push_back(Expr);
956 // Compute the addrec with zero as its base.
957 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
958 Ops[0] = Zero; // Start with zero base.
959 SubExprs.push_back(SE->getAddRecExpr(Ops, SARE->getLoop()));
962 SeparateSubExprs(SubExprs, SARE->getOperand(0), SE);
964 } else if (!Expr->isZero()) {
966 SubExprs.push_back(Expr);
970 // This is logically local to the following function, but C++ says we have
971 // to make it file scope.
972 struct SubExprUseData { unsigned Count; bool notAllUsesAreFree; };
974 /// RemoveCommonExpressionsFromUseBases - Look through all of the Bases of all
975 /// the Uses, removing any common subexpressions, except that if all such
976 /// subexpressions can be folded into an addressing mode for all uses inside
977 /// the loop (this case is referred to as "free" in comments herein) we do
978 /// not remove anything. This looks for things like (a+b+c) and
979 /// (a+c+d) and computes the common (a+c) subexpression. The common expression
980 /// is *removed* from the Bases and returned.
982 RemoveCommonExpressionsFromUseBases(std::vector<BasedUser> &Uses,
983 ScalarEvolution *SE, Loop *L,
984 const TargetLowering *TLI) {
985 unsigned NumUses = Uses.size();
987 // Only one use? This is a very common case, so we handle it specially and
989 SCEVHandle Zero = SE->getIntegerSCEV(0, Uses[0].Base->getType());
990 SCEVHandle Result = Zero;
991 SCEVHandle FreeResult = Zero;
993 // If the use is inside the loop, use its base, regardless of what it is:
994 // it is clearly shared across all the IV's. If the use is outside the loop
995 // (which means after it) we don't want to factor anything *into* the loop,
996 // so just use 0 as the base.
997 if (L->contains(Uses[0].Inst->getParent()))
998 std::swap(Result, Uses[0].Base);
1002 // To find common subexpressions, count how many of Uses use each expression.
1003 // If any subexpressions are used Uses.size() times, they are common.
1004 // Also track whether all uses of each expression can be moved into an
1005 // an addressing mode "for free"; such expressions are left within the loop.
1006 // struct SubExprUseData { unsigned Count; bool notAllUsesAreFree; };
1007 std::map<SCEVHandle, SubExprUseData> SubExpressionUseData;
1009 // UniqueSubExprs - Keep track of all of the subexpressions we see in the
1010 // order we see them.
1011 std::vector<SCEVHandle> UniqueSubExprs;
1013 std::vector<SCEVHandle> SubExprs;
1014 unsigned NumUsesInsideLoop = 0;
1015 for (unsigned i = 0; i != NumUses; ++i) {
1016 // If the user is outside the loop, just ignore it for base computation.
1017 // Since the user is outside the loop, it must be *after* the loop (if it
1018 // were before, it could not be based on the loop IV). We don't want users
1019 // after the loop to affect base computation of values *inside* the loop,
1020 // because we can always add their offsets to the result IV after the loop
1021 // is done, ensuring we get good code inside the loop.
1022 if (!L->contains(Uses[i].Inst->getParent()))
1024 NumUsesInsideLoop++;
1026 // If the base is zero (which is common), return zero now, there are no
1027 // CSEs we can find.
1028 if (Uses[i].Base == Zero) return Zero;
1030 // If this use is as an address we may be able to put CSEs in the addressing
1031 // mode rather than hoisting them.
1032 bool isAddrUse = isAddressUse(Uses[i].Inst, Uses[i].OperandValToReplace);
1033 // We may need the UseTy below, but only when isAddrUse, so compute it
1034 // only in that case.
1035 const Type *UseTy = 0;
1037 UseTy = getAccessType(Uses[i].Inst);
1039 // Split the expression into subexprs.
1040 SeparateSubExprs(SubExprs, Uses[i].Base, SE);
1041 // Add one to SubExpressionUseData.Count for each subexpr present, and
1042 // if the subexpr is not a valid immediate within an addressing mode use,
1043 // set SubExpressionUseData.notAllUsesAreFree. We definitely want to
1044 // hoist these out of the loop (if they are common to all uses).
1045 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j) {
1046 if (++SubExpressionUseData[SubExprs[j]].Count == 1)
1047 UniqueSubExprs.push_back(SubExprs[j]);
1048 if (!isAddrUse || !fitsInAddressMode(SubExprs[j], UseTy, TLI, false))
1049 SubExpressionUseData[SubExprs[j]].notAllUsesAreFree = true;
1054 // Now that we know how many times each is used, build Result. Iterate over
1055 // UniqueSubexprs so that we have a stable ordering.
1056 for (unsigned i = 0, e = UniqueSubExprs.size(); i != e; ++i) {
1057 std::map<SCEVHandle, SubExprUseData>::iterator I =
1058 SubExpressionUseData.find(UniqueSubExprs[i]);
1059 assert(I != SubExpressionUseData.end() && "Entry not found?");
1060 if (I->second.Count == NumUsesInsideLoop) { // Found CSE!
1061 if (I->second.notAllUsesAreFree)
1062 Result = SE->getAddExpr(Result, I->first);
1064 FreeResult = SE->getAddExpr(FreeResult, I->first);
1066 // Remove non-cse's from SubExpressionUseData.
1067 SubExpressionUseData.erase(I);
1070 if (FreeResult != Zero) {
1071 // We have some subexpressions that can be subsumed into addressing
1072 // modes in every use inside the loop. However, it's possible that
1073 // there are so many of them that the combined FreeResult cannot
1074 // be subsumed, or that the target cannot handle both a FreeResult
1075 // and a Result in the same instruction (for example because it would
1076 // require too many registers). Check this.
1077 for (unsigned i=0; i<NumUses; ++i) {
1078 if (!L->contains(Uses[i].Inst->getParent()))
1080 // We know this is an addressing mode use; if there are any uses that
1081 // are not, FreeResult would be Zero.
1082 const Type *UseTy = getAccessType(Uses[i].Inst);
1083 if (!fitsInAddressMode(FreeResult, UseTy, TLI, Result!=Zero)) {
1084 // FIXME: could split up FreeResult into pieces here, some hoisted
1085 // and some not. There is no obvious advantage to this.
1086 Result = SE->getAddExpr(Result, FreeResult);
1093 // If we found no CSE's, return now.
1094 if (Result == Zero) return Result;
1096 // If we still have a FreeResult, remove its subexpressions from
1097 // SubExpressionUseData. This means they will remain in the use Bases.
1098 if (FreeResult != Zero) {
1099 SeparateSubExprs(SubExprs, FreeResult, SE);
1100 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j) {
1101 std::map<SCEVHandle, SubExprUseData>::iterator I =
1102 SubExpressionUseData.find(SubExprs[j]);
1103 SubExpressionUseData.erase(I);
1108 // Otherwise, remove all of the CSE's we found from each of the base values.
1109 for (unsigned i = 0; i != NumUses; ++i) {
1110 // Uses outside the loop don't necessarily include the common base, but
1111 // the final IV value coming into those uses does. Instead of trying to
1112 // remove the pieces of the common base, which might not be there,
1113 // subtract off the base to compensate for this.
1114 if (!L->contains(Uses[i].Inst->getParent())) {
1115 Uses[i].Base = SE->getMinusSCEV(Uses[i].Base, Result);
1119 // Split the expression into subexprs.
1120 SeparateSubExprs(SubExprs, Uses[i].Base, SE);
1122 // Remove any common subexpressions.
1123 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j)
1124 if (SubExpressionUseData.count(SubExprs[j])) {
1125 SubExprs.erase(SubExprs.begin()+j);
1129 // Finally, add the non-shared expressions together.
1130 if (SubExprs.empty())
1131 Uses[i].Base = Zero;
1133 Uses[i].Base = SE->getAddExpr(SubExprs);
1140 /// ValidStride - Check whether the given Scale is valid for all loads and
1141 /// stores in UsersToProcess.
1143 bool LoopStrengthReduce::ValidStride(bool HasBaseReg,
1145 const std::vector<BasedUser>& UsersToProcess) {
1149 for (unsigned i=0, e = UsersToProcess.size(); i!=e; ++i) {
1150 // If this is a load or other access, pass the type of the access in.
1151 const Type *AccessTy = Type::VoidTy;
1152 if (isAddressUse(UsersToProcess[i].Inst,
1153 UsersToProcess[i].OperandValToReplace))
1154 AccessTy = getAccessType(UsersToProcess[i].Inst);
1155 else if (isa<PHINode>(UsersToProcess[i].Inst))
1158 TargetLowering::AddrMode AM;
1159 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(UsersToProcess[i].Imm))
1160 AM.BaseOffs = SC->getValue()->getSExtValue();
1161 AM.HasBaseReg = HasBaseReg || !UsersToProcess[i].Base->isZero();
1164 // If load[imm+r*scale] is illegal, bail out.
1165 if (!TLI->isLegalAddressingMode(AM, AccessTy))
1171 /// RequiresTypeConversion - Returns true if converting Ty1 to Ty2 is not
1173 bool LoopStrengthReduce::RequiresTypeConversion(const Type *Ty1,
1177 if (Ty1->canLosslesslyBitCastTo(Ty2))
1179 if (TLI && TLI->isTruncateFree(Ty1, Ty2))
1181 if (isa<PointerType>(Ty2) && Ty1->canLosslesslyBitCastTo(UIntPtrTy))
1183 if (isa<PointerType>(Ty1) && Ty2->canLosslesslyBitCastTo(UIntPtrTy))
1188 /// CheckForIVReuse - Returns the multiple if the stride is the multiple
1189 /// of a previous stride and it is a legal value for the target addressing
1190 /// mode scale component and optional base reg. This allows the users of
1191 /// this stride to be rewritten as prev iv * factor. It returns 0 if no
1192 /// reuse is possible. Factors can be negative on same targets, e.g. ARM.
1194 /// If all uses are outside the loop, we don't require that all multiplies
1195 /// be folded into the addressing mode, nor even that the factor be constant;
1196 /// a multiply (executed once) outside the loop is better than another IV
1197 /// within. Well, usually.
1198 SCEVHandle LoopStrengthReduce::CheckForIVReuse(bool HasBaseReg,
1199 bool AllUsesAreAddresses,
1200 bool AllUsesAreOutsideLoop,
1201 const SCEVHandle &Stride,
1202 IVExpr &IV, const Type *Ty,
1203 const std::vector<BasedUser>& UsersToProcess) {
1204 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Stride)) {
1205 int64_t SInt = SC->getValue()->getSExtValue();
1206 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1208 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1209 IVsByStride.find(StrideOrder[NewStride]);
1210 if (SI == IVsByStride.end() || !isa<SCEVConstant>(SI->first))
1212 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
1213 if (SI->first != Stride &&
1214 (unsigned(abs(SInt)) < SSInt || (SInt % SSInt) != 0))
1216 int64_t Scale = SInt / SSInt;
1217 // Check that this stride is valid for all the types used for loads and
1218 // stores; if it can be used for some and not others, we might as well use
1219 // the original stride everywhere, since we have to create the IV for it
1220 // anyway. If the scale is 1, then we don't need to worry about folding
1223 (AllUsesAreAddresses &&
1224 ValidStride(HasBaseReg, Scale, UsersToProcess)))
1225 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1226 IE = SI->second.IVs.end(); II != IE; ++II)
1227 // FIXME: Only handle base == 0 for now.
1228 // Only reuse previous IV if it would not require a type conversion.
1229 if (II->Base->isZero() &&
1230 !RequiresTypeConversion(II->Base->getType(), Ty)) {
1232 return SE->getIntegerSCEV(Scale, Stride->getType());
1235 } else if (AllUsesAreOutsideLoop) {
1236 // Accept nonconstant strides here; it is really really right to substitute
1237 // an existing IV if we can.
1238 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1240 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1241 IVsByStride.find(StrideOrder[NewStride]);
1242 if (SI == IVsByStride.end() || !isa<SCEVConstant>(SI->first))
1244 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
1245 if (SI->first != Stride && SSInt != 1)
1247 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1248 IE = SI->second.IVs.end(); II != IE; ++II)
1249 // Accept nonzero base here.
1250 // Only reuse previous IV if it would not require a type conversion.
1251 if (!RequiresTypeConversion(II->Base->getType(), Ty)) {
1256 // Special case, old IV is -1*x and this one is x. Can treat this one as
1258 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1260 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1261 IVsByStride.find(StrideOrder[NewStride]);
1262 if (SI == IVsByStride.end())
1264 if (SCEVMulExpr *ME = dyn_cast<SCEVMulExpr>(SI->first))
1265 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(ME->getOperand(0)))
1266 if (Stride == ME->getOperand(1) &&
1267 SC->getValue()->getSExtValue() == -1LL)
1268 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1269 IE = SI->second.IVs.end(); II != IE; ++II)
1270 // Accept nonzero base here.
1271 // Only reuse previous IV if it would not require type conversion.
1272 if (!RequiresTypeConversion(II->Base->getType(), Ty)) {
1274 return SE->getIntegerSCEV(-1LL, Stride->getType());
1278 return SE->getIntegerSCEV(0, Stride->getType());
1281 /// PartitionByIsUseOfPostIncrementedValue - Simple boolean predicate that
1282 /// returns true if Val's isUseOfPostIncrementedValue is true.
1283 static bool PartitionByIsUseOfPostIncrementedValue(const BasedUser &Val) {
1284 return Val.isUseOfPostIncrementedValue;
1287 /// isNonConstantNegative - Return true if the specified scev is negated, but
1289 static bool isNonConstantNegative(const SCEVHandle &Expr) {
1290 SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(Expr);
1291 if (!Mul) return false;
1293 // If there is a constant factor, it will be first.
1294 SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0));
1295 if (!SC) return false;
1297 // Return true if the value is negative, this matches things like (-42 * V).
1298 return SC->getValue()->getValue().isNegative();
1301 // CollectIVUsers - Transform our list of users and offsets to a bit more
1302 // complex table. In this new vector, each 'BasedUser' contains 'Base', the base
1303 // of the strided accesses, as well as the old information from Uses. We
1304 // progressively move information from the Base field to the Imm field, until
1305 // we eventually have the full access expression to rewrite the use.
1306 SCEVHandle LoopStrengthReduce::CollectIVUsers(const SCEVHandle &Stride,
1307 IVUsersOfOneStride &Uses,
1309 bool &AllUsesAreAddresses,
1310 bool &AllUsesAreOutsideLoop,
1311 std::vector<BasedUser> &UsersToProcess) {
1312 UsersToProcess.reserve(Uses.Users.size());
1313 for (unsigned i = 0, e = Uses.Users.size(); i != e; ++i) {
1314 UsersToProcess.push_back(BasedUser(Uses.Users[i], SE));
1316 // Move any loop variant operands from the offset field to the immediate
1317 // field of the use, so that we don't try to use something before it is
1319 MoveLoopVariantsToImmediateField(UsersToProcess.back().Base,
1320 UsersToProcess.back().Imm, L, SE);
1321 assert(UsersToProcess.back().Base->isLoopInvariant(L) &&
1322 "Base value is not loop invariant!");
1325 // We now have a whole bunch of uses of like-strided induction variables, but
1326 // they might all have different bases. We want to emit one PHI node for this
1327 // stride which we fold as many common expressions (between the IVs) into as
1328 // possible. Start by identifying the common expressions in the base values
1329 // for the strides (e.g. if we have "A+C+B" and "A+B+D" as our bases, find
1330 // "A+B"), emit it to the preheader, then remove the expression from the
1331 // UsersToProcess base values.
1332 SCEVHandle CommonExprs =
1333 RemoveCommonExpressionsFromUseBases(UsersToProcess, SE, L, TLI);
1335 // Next, figure out what we can represent in the immediate fields of
1336 // instructions. If we can represent anything there, move it to the imm
1337 // fields of the BasedUsers. We do this so that it increases the commonality
1338 // of the remaining uses.
1339 unsigned NumPHI = 0;
1340 bool HasAddress = false;
1341 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1342 // If the user is not in the current loop, this means it is using the exit
1343 // value of the IV. Do not put anything in the base, make sure it's all in
1344 // the immediate field to allow as much factoring as possible.
1345 if (!L->contains(UsersToProcess[i].Inst->getParent())) {
1346 UsersToProcess[i].Imm = SE->getAddExpr(UsersToProcess[i].Imm,
1347 UsersToProcess[i].Base);
1348 UsersToProcess[i].Base =
1349 SE->getIntegerSCEV(0, UsersToProcess[i].Base->getType());
1351 // Not all uses are outside the loop.
1352 AllUsesAreOutsideLoop = false;
1354 // Addressing modes can be folded into loads and stores. Be careful that
1355 // the store is through the expression, not of the expression though.
1357 bool isAddress = isAddressUse(UsersToProcess[i].Inst,
1358 UsersToProcess[i].OperandValToReplace);
1359 if (isa<PHINode>(UsersToProcess[i].Inst)) {
1367 // If this use isn't an address, then not all uses are addresses.
1368 if (!isAddress && !isPHI)
1369 AllUsesAreAddresses = false;
1371 MoveImmediateValues(TLI, UsersToProcess[i].Inst, UsersToProcess[i].Base,
1372 UsersToProcess[i].Imm, isAddress, L, SE);
1376 // If one of the use is a PHI node and all other uses are addresses, still
1377 // allow iv reuse. Essentially we are trading one constant multiplication
1378 // for one fewer iv.
1380 AllUsesAreAddresses = false;
1382 // There are no in-loop address uses.
1383 if (AllUsesAreAddresses && (!HasAddress && !AllUsesAreOutsideLoop))
1384 AllUsesAreAddresses = false;
1389 /// ShouldUseFullStrengthReductionMode - Test whether full strength-reduction
1390 /// is valid and profitable for the given set of users of a stride. In
1391 /// full strength-reduction mode, all addresses at the current stride are
1392 /// strength-reduced all the way down to pointer arithmetic.
1394 bool LoopStrengthReduce::ShouldUseFullStrengthReductionMode(
1395 const std::vector<BasedUser> &UsersToProcess,
1397 bool AllUsesAreAddresses,
1398 SCEVHandle Stride) {
1399 if (!EnableFullLSRMode)
1402 // The heuristics below aim to avoid increasing register pressure, but
1403 // fully strength-reducing all the addresses increases the number of
1404 // add instructions, so don't do this when optimizing for size.
1405 // TODO: If the loop is large, the savings due to simpler addresses
1406 // may oughtweight the costs of the extra increment instructions.
1407 if (L->getHeader()->getParent()->hasFnAttr(Attribute::OptimizeForSize))
1410 // TODO: For now, don't do full strength reduction if there could
1411 // potentially be greater-stride multiples of the current stride
1412 // which could reuse the current stride IV.
1413 if (StrideOrder.back() != Stride)
1416 // Iterate through the uses to find conditions that automatically rule out
1418 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ) {
1419 SCEV *Base = UsersToProcess[i].Base;
1420 SCEV *Imm = UsersToProcess[i].Imm;
1421 // If any users have a loop-variant component, they can't be fully
1422 // strength-reduced.
1423 if (Imm && !Imm->isLoopInvariant(L))
1425 // If there are to users with the same base and the difference between
1426 // the two Imm values can't be folded into the address, full
1427 // strength reduction would increase register pressure.
1429 SCEV *CurImm = UsersToProcess[i].Imm;
1430 if ((CurImm || Imm) && CurImm != Imm) {
1431 if (!CurImm) CurImm = SE->getIntegerSCEV(0, Stride->getType());
1432 if (!Imm) Imm = SE->getIntegerSCEV(0, Stride->getType());
1433 const Instruction *Inst = UsersToProcess[i].Inst;
1434 const Type *UseTy = getAccessType(Inst);
1435 SCEVHandle Diff = SE->getMinusSCEV(UsersToProcess[i].Imm, Imm);
1436 if (!Diff->isZero() &&
1437 (!AllUsesAreAddresses ||
1438 !fitsInAddressMode(Diff, UseTy, TLI, /*HasBaseReg=*/true)))
1441 } while (++i != e && Base == UsersToProcess[i].Base);
1444 // If there's exactly one user in this stride, fully strength-reducing it
1445 // won't increase register pressure. If it's starting from a non-zero base,
1446 // it'll be simpler this way.
1447 if (UsersToProcess.size() == 1 && !UsersToProcess[0].Base->isZero())
1450 // Otherwise, if there are any users in this stride that don't require
1451 // a register for their base, full strength-reduction will increase
1452 // register pressure.
1453 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1454 if (UsersToProcess[i].Base->isZero())
1457 // Otherwise, go for it.
1461 /// InsertAffinePhi Create and insert a PHI node for an induction variable
1462 /// with the specified start and step values in the specified loop.
1464 /// If NegateStride is true, the stride should be negated by using a
1465 /// subtract instead of an add.
1467 /// Return the created phi node.
1469 static PHINode *InsertAffinePhi(SCEVHandle Start, SCEVHandle Step,
1471 const TargetData *TD,
1472 SCEVExpander &Rewriter) {
1473 assert(Start->isLoopInvariant(L) && "New PHI start is not loop invariant!");
1474 assert(Step->isLoopInvariant(L) && "New PHI stride is not loop invariant!");
1476 BasicBlock *Header = L->getHeader();
1477 BasicBlock *Preheader = L->getLoopPreheader();
1478 BasicBlock *LatchBlock = L->getLoopLatch();
1479 const Type *Ty = Start->getType();
1480 if (isa<PointerType>(Ty)) Ty = TD->getIntPtrType();
1482 PHINode *PN = PHINode::Create(Ty, "lsr.iv", Header->begin());
1483 PN->addIncoming(Rewriter.expandCodeFor(Start, Ty, Preheader->getTerminator()),
1486 // If the stride is negative, insert a sub instead of an add for the
1488 bool isNegative = isNonConstantNegative(Step);
1489 SCEVHandle IncAmount = Step;
1491 IncAmount = Rewriter.SE.getNegativeSCEV(Step);
1493 // Insert an add instruction right before the terminator corresponding
1494 // to the back-edge.
1495 Value *StepV = Rewriter.expandCodeFor(IncAmount, Ty,
1496 Preheader->getTerminator());
1499 IncV = BinaryOperator::CreateSub(PN, StepV, "lsr.iv.next",
1500 LatchBlock->getTerminator());
1502 IncV = BinaryOperator::CreateAdd(PN, StepV, "lsr.iv.next",
1503 LatchBlock->getTerminator());
1505 if (!isa<ConstantInt>(StepV)) ++NumVariable;
1507 PN->addIncoming(IncV, LatchBlock);
1513 static void SortUsersToProcess(std::vector<BasedUser> &UsersToProcess) {
1514 // We want to emit code for users inside the loop first. To do this, we
1515 // rearrange BasedUser so that the entries at the end have
1516 // isUseOfPostIncrementedValue = false, because we pop off the end of the
1517 // vector (so we handle them first).
1518 std::partition(UsersToProcess.begin(), UsersToProcess.end(),
1519 PartitionByIsUseOfPostIncrementedValue);
1521 // Sort this by base, so that things with the same base are handled
1522 // together. By partitioning first and stable-sorting later, we are
1523 // guaranteed that within each base we will pop off users from within the
1524 // loop before users outside of the loop with a particular base.
1526 // We would like to use stable_sort here, but we can't. The problem is that
1527 // SCEVHandle's don't have a deterministic ordering w.r.t to each other, so
1528 // we don't have anything to do a '<' comparison on. Because we think the
1529 // number of uses is small, do a horrible bubble sort which just relies on
1531 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1532 // Get a base value.
1533 SCEVHandle Base = UsersToProcess[i].Base;
1535 // Compact everything with this base to be consecutive with this one.
1536 for (unsigned j = i+1; j != e; ++j) {
1537 if (UsersToProcess[j].Base == Base) {
1538 std::swap(UsersToProcess[i+1], UsersToProcess[j]);
1545 /// PrepareToStrengthReduceFully - Prepare to fully strength-reduce
1546 /// UsersToProcess, meaning lowering addresses all the way down to direct
1547 /// pointer arithmetic.
1550 LoopStrengthReduce::PrepareToStrengthReduceFully(
1551 std::vector<BasedUser> &UsersToProcess,
1553 SCEVHandle CommonExprs,
1555 SCEVExpander &PreheaderRewriter) {
1556 DOUT << " Fully reducing all users\n";
1558 // Rewrite the UsersToProcess records, creating a separate PHI for each
1559 // unique Base value.
1560 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ) {
1561 // TODO: The uses are grouped by base, but not sorted. We arbitrarily
1562 // pick the first Imm value here to start with, and adjust it for the
1564 SCEVHandle Imm = UsersToProcess[i].Imm;
1565 SCEVHandle Base = UsersToProcess[i].Base;
1566 SCEVHandle Start = SE->getAddExpr(CommonExprs, Base, Imm);
1567 PHINode *Phi = InsertAffinePhi(Start, Stride, L, TD,
1569 // Loop over all the users with the same base.
1571 UsersToProcess[i].Base = SE->getIntegerSCEV(0, Stride->getType());
1572 UsersToProcess[i].Imm = SE->getMinusSCEV(UsersToProcess[i].Imm, Imm);
1573 UsersToProcess[i].Phi = Phi;
1574 assert(UsersToProcess[i].Imm->isLoopInvariant(L) &&
1575 "ShouldUseFullStrengthReductionMode should reject this!");
1576 } while (++i != e && Base == UsersToProcess[i].Base);
1580 /// PrepareToStrengthReduceWithNewPhi - Insert a new induction variable for the
1581 /// given users to share.
1584 LoopStrengthReduce::PrepareToStrengthReduceWithNewPhi(
1585 std::vector<BasedUser> &UsersToProcess,
1587 SCEVHandle CommonExprs,
1590 SCEVExpander &PreheaderRewriter) {
1591 DOUT << " Inserting new PHI:\n";
1593 PHINode *Phi = InsertAffinePhi(SE->getUnknown(CommonBaseV),
1597 // Remember this in case a later stride is multiple of this.
1598 IVsByStride[Stride].addIV(Stride, CommonExprs, Phi);
1600 // All the users will share this new IV.
1601 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1602 UsersToProcess[i].Phi = Phi;
1605 DEBUG(WriteAsOperand(*DOUT, Phi, /*PrintType=*/false));
1609 /// PrepareToStrengthReduceWithNewPhi - Prepare for the given users to reuse
1610 /// an induction variable with a stride that is a factor of the current
1611 /// induction variable.
1614 LoopStrengthReduce::PrepareToStrengthReduceFromSmallerStride(
1615 std::vector<BasedUser> &UsersToProcess,
1617 const IVExpr &ReuseIV,
1618 Instruction *PreInsertPt) {
1619 DOUT << " Rewriting in terms of existing IV of STRIDE " << *ReuseIV.Stride
1620 << " and BASE " << *ReuseIV.Base << "\n";
1622 // All the users will share the reused IV.
1623 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1624 UsersToProcess[i].Phi = ReuseIV.PHI;
1626 Constant *C = dyn_cast<Constant>(CommonBaseV);
1628 (!C->isNullValue() &&
1629 !fitsInAddressMode(SE->getUnknown(CommonBaseV), CommonBaseV->getType(),
1631 // We want the common base emitted into the preheader! This is just
1632 // using cast as a copy so BitCast (no-op cast) is appropriate
1633 CommonBaseV = new BitCastInst(CommonBaseV, CommonBaseV->getType(),
1634 "commonbase", PreInsertPt);
1637 static bool IsImmFoldedIntoAddrMode(GlobalValue *GV, int64_t Offset,
1638 const Type *AccessTy,
1639 std::vector<BasedUser> &UsersToProcess,
1640 const TargetLowering *TLI) {
1641 SmallVector<Instruction*, 16> AddrModeInsts;
1642 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1643 if (UsersToProcess[i].isUseOfPostIncrementedValue)
1645 ExtAddrMode AddrMode =
1646 AddressingModeMatcher::Match(UsersToProcess[i].OperandValToReplace,
1647 AccessTy, UsersToProcess[i].Inst,
1648 AddrModeInsts, *TLI);
1649 if (GV && GV != AddrMode.BaseGV)
1651 if (Offset && !AddrMode.BaseOffs)
1652 // FIXME: How to accurate check it's immediate offset is folded.
1654 AddrModeInsts.clear();
1659 /// StrengthReduceStridedIVUsers - Strength reduce all of the users of a single
1660 /// stride of IV. All of the users may have different starting values, and this
1661 /// may not be the only stride.
1662 void LoopStrengthReduce::StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
1663 IVUsersOfOneStride &Uses,
1665 // If all the users are moved to another stride, then there is nothing to do.
1666 if (Uses.Users.empty())
1669 // Keep track if every use in UsersToProcess is an address. If they all are,
1670 // we may be able to rewrite the entire collection of them in terms of a
1671 // smaller-stride IV.
1672 bool AllUsesAreAddresses = true;
1674 // Keep track if every use of a single stride is outside the loop. If so,
1675 // we want to be more aggressive about reusing a smaller-stride IV; a
1676 // multiply outside the loop is better than another IV inside. Well, usually.
1677 bool AllUsesAreOutsideLoop = true;
1679 // Transform our list of users and offsets to a bit more complex table. In
1680 // this new vector, each 'BasedUser' contains 'Base' the base of the
1681 // strided accessas well as the old information from Uses. We progressively
1682 // move information from the Base field to the Imm field, until we eventually
1683 // have the full access expression to rewrite the use.
1684 std::vector<BasedUser> UsersToProcess;
1685 SCEVHandle CommonExprs = CollectIVUsers(Stride, Uses, L, AllUsesAreAddresses,
1686 AllUsesAreOutsideLoop,
1689 // Sort the UsersToProcess array so that users with common bases are
1690 // next to each other.
1691 SortUsersToProcess(UsersToProcess);
1693 // If we managed to find some expressions in common, we'll need to carry
1694 // their value in a register and add it in for each use. This will take up
1695 // a register operand, which potentially restricts what stride values are
1697 bool HaveCommonExprs = !CommonExprs->isZero();
1699 const Type *ReplacedTy = CommonExprs->getType();
1700 if (isa<PointerType>(ReplacedTy)) ReplacedTy = TD->getIntPtrType();
1702 // If all uses are addresses, consider sinking the immediate part of the
1703 // common expression back into uses if they can fit in the immediate fields.
1704 if (TLI && HaveCommonExprs && AllUsesAreAddresses) {
1705 SCEVHandle NewCommon = CommonExprs;
1706 SCEVHandle Imm = SE->getIntegerSCEV(0, ReplacedTy);
1707 MoveImmediateValues(TLI, Type::VoidTy, NewCommon, Imm, true, L, SE);
1708 if (!Imm->isZero()) {
1711 // If the immediate part of the common expression is a GV, check if it's
1712 // possible to fold it into the target addressing mode.
1713 GlobalValue *GV = 0;
1714 if (SCEVUnknown *SU = dyn_cast<SCEVUnknown>(Imm))
1715 GV = dyn_cast<GlobalValue>(SU->getValue());
1717 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Imm))
1718 Offset = SC->getValue()->getSExtValue();
1720 // Pass VoidTy as the AccessTy to be conservative, because
1721 // there could be multiple access types among all the uses.
1722 DoSink = IsImmFoldedIntoAddrMode(GV, Offset, Type::VoidTy,
1723 UsersToProcess, TLI);
1726 DOUT << " Sinking " << *Imm << " back down into uses\n";
1727 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1728 UsersToProcess[i].Imm = SE->getAddExpr(UsersToProcess[i].Imm, Imm);
1729 CommonExprs = NewCommon;
1730 HaveCommonExprs = !CommonExprs->isZero();
1736 // Now that we know what we need to do, insert the PHI node itself.
1738 DOUT << "LSR: Examining IVs of TYPE " << *ReplacedTy << " of STRIDE "
1740 << " Common base: " << *CommonExprs << "\n";
1742 SCEVExpander Rewriter(*SE, *LI, *TD);
1743 SCEVExpander PreheaderRewriter(*SE, *LI, *TD);
1745 BasicBlock *Preheader = L->getLoopPreheader();
1746 Instruction *PreInsertPt = Preheader->getTerminator();
1747 BasicBlock *LatchBlock = L->getLoopLatch();
1749 Value *CommonBaseV = ConstantInt::get(ReplacedTy, 0);
1751 SCEVHandle RewriteFactor = SE->getIntegerSCEV(0, ReplacedTy);
1752 IVExpr ReuseIV(SE->getIntegerSCEV(0, Type::Int32Ty),
1753 SE->getIntegerSCEV(0, Type::Int32Ty),
1756 /// Choose a strength-reduction strategy and prepare for it by creating
1757 /// the necessary PHIs and adjusting the bookkeeping.
1758 if (ShouldUseFullStrengthReductionMode(UsersToProcess, L,
1759 AllUsesAreAddresses, Stride)) {
1760 PrepareToStrengthReduceFully(UsersToProcess, Stride, CommonExprs, L,
1763 // Emit the initial base value into the loop preheader.
1764 CommonBaseV = PreheaderRewriter.expandCodeFor(CommonExprs, ReplacedTy,
1767 // If all uses are addresses, check if it is possible to reuse an IV with a
1768 // stride that is a factor of this stride. And that the multiple is a number
1769 // that can be encoded in the scale field of the target addressing mode. And
1770 // that we will have a valid instruction after this substition, including
1771 // the immediate field, if any.
1772 RewriteFactor = CheckForIVReuse(HaveCommonExprs, AllUsesAreAddresses,
1773 AllUsesAreOutsideLoop,
1774 Stride, ReuseIV, ReplacedTy,
1776 if (isa<SCEVConstant>(RewriteFactor) &&
1777 cast<SCEVConstant>(RewriteFactor)->isZero())
1778 PrepareToStrengthReduceWithNewPhi(UsersToProcess, Stride, CommonExprs,
1779 CommonBaseV, L, PreheaderRewriter);
1781 PrepareToStrengthReduceFromSmallerStride(UsersToProcess, CommonBaseV,
1782 ReuseIV, PreInsertPt);
1785 // Process all the users now, replacing their strided uses with
1786 // strength-reduced forms. This outer loop handles all bases, the inner
1787 // loop handles all users of a particular base.
1788 while (!UsersToProcess.empty()) {
1789 SCEVHandle Base = UsersToProcess.back().Base;
1790 Instruction *Inst = UsersToProcess.back().Inst;
1792 // Emit the code for Base into the preheader.
1794 if (!Base->isZero()) {
1795 BaseV = PreheaderRewriter.expandCodeFor(Base, Base->getType(),
1798 DOUT << " INSERTING code for BASE = " << *Base << ":";
1799 if (BaseV->hasName())
1800 DOUT << " Result value name = %" << BaseV->getNameStr();
1803 // If BaseV is a non-zero constant, make sure that it gets inserted into
1804 // the preheader, instead of being forward substituted into the uses. We
1805 // do this by forcing a BitCast (noop cast) to be inserted into the
1806 // preheader in this case.
1807 if (!fitsInAddressMode(Base, getAccessType(Inst), TLI, false)) {
1808 // We want this constant emitted into the preheader! This is just
1809 // using cast as a copy so BitCast (no-op cast) is appropriate
1810 BaseV = new BitCastInst(BaseV, BaseV->getType(), "preheaderinsert",
1815 // Emit the code to add the immediate offset to the Phi value, just before
1816 // the instructions that we identified as using this stride and base.
1818 // FIXME: Use emitted users to emit other users.
1819 BasedUser &User = UsersToProcess.back();
1821 DOUT << " Examining use ";
1822 DEBUG(WriteAsOperand(*DOUT, UsersToProcess.back().OperandValToReplace,
1823 /*PrintType=*/false));
1824 DOUT << " in Inst: " << *Inst;
1826 // If this instruction wants to use the post-incremented value, move it
1827 // after the post-inc and use its value instead of the PHI.
1828 Value *RewriteOp = User.Phi;
1829 if (User.isUseOfPostIncrementedValue) {
1830 RewriteOp = User.Phi->getIncomingValueForBlock(LatchBlock);
1832 // If this user is in the loop, make sure it is the last thing in the
1833 // loop to ensure it is dominated by the increment.
1834 if (L->contains(User.Inst->getParent()))
1835 User.Inst->moveBefore(LatchBlock->getTerminator());
1838 SCEVHandle RewriteExpr = SE->getUnknown(RewriteOp);
1840 if (TD->getTypeSizeInBits(RewriteOp->getType()) !=
1841 TD->getTypeSizeInBits(ReplacedTy)) {
1842 assert(TD->getTypeSizeInBits(RewriteOp->getType()) >
1843 TD->getTypeSizeInBits(ReplacedTy) &&
1844 "Unexpected widening cast!");
1845 RewriteExpr = SE->getTruncateExpr(RewriteExpr, ReplacedTy);
1848 // If we had to insert new instructions for RewriteOp, we have to
1849 // consider that they may not have been able to end up immediately
1850 // next to RewriteOp, because non-PHI instructions may never precede
1851 // PHI instructions in a block. In this case, remember where the last
1852 // instruction was inserted so that if we're replacing a different
1853 // PHI node, we can use the later point to expand the final
1855 Instruction *NewBasePt = dyn_cast<Instruction>(RewriteOp);
1856 if (RewriteOp == User.Phi) NewBasePt = 0;
1858 // Clear the SCEVExpander's expression map so that we are guaranteed
1859 // to have the code emitted where we expect it.
1862 // If we are reusing the iv, then it must be multiplied by a constant
1863 // factor to take advantage of the addressing mode scale component.
1864 if (!RewriteFactor->isZero()) {
1865 // If we're reusing an IV with a nonzero base (currently this happens
1866 // only when all reuses are outside the loop) subtract that base here.
1867 // The base has been used to initialize the PHI node but we don't want
1869 if (!ReuseIV.Base->isZero()) {
1870 SCEVHandle typedBase = ReuseIV.Base;
1871 if (TD->getTypeSizeInBits(RewriteExpr->getType()) !=
1872 TD->getTypeSizeInBits(ReuseIV.Base->getType())) {
1873 // It's possible the original IV is a larger type than the new IV,
1874 // in which case we have to truncate the Base. We checked in
1875 // RequiresTypeConversion that this is valid.
1876 assert(TD->getTypeSizeInBits(RewriteExpr->getType()) <
1877 TD->getTypeSizeInBits(ReuseIV.Base->getType()) &&
1878 "Unexpected lengthening conversion!");
1879 typedBase = SE->getTruncateExpr(ReuseIV.Base,
1880 RewriteExpr->getType());
1882 RewriteExpr = SE->getMinusSCEV(RewriteExpr, typedBase);
1885 // Multiply old variable, with base removed, by new scale factor.
1886 RewriteExpr = SE->getMulExpr(RewriteFactor,
1889 // The common base is emitted in the loop preheader. But since we
1890 // are reusing an IV, it has not been used to initialize the PHI node.
1891 // Add it to the expression used to rewrite the uses.
1892 // When this use is outside the loop, we earlier subtracted the
1893 // common base, and are adding it back here. Use the same expression
1894 // as before, rather than CommonBaseV, so DAGCombiner will zap it.
1895 if (!CommonExprs->isZero()) {
1896 if (L->contains(User.Inst->getParent()))
1897 RewriteExpr = SE->getAddExpr(RewriteExpr,
1898 SE->getUnknown(CommonBaseV));
1900 RewriteExpr = SE->getAddExpr(RewriteExpr, CommonExprs);
1904 // Now that we know what we need to do, insert code before User for the
1905 // immediate and any loop-variant expressions.
1907 // Add BaseV to the PHI value if needed.
1908 RewriteExpr = SE->getAddExpr(RewriteExpr, SE->getUnknown(BaseV));
1910 User.RewriteInstructionToUseNewBase(RewriteExpr, NewBasePt,
1914 // Mark old value we replaced as possibly dead, so that it is eliminated
1915 // if we just replaced the last use of that value.
1916 DeadInsts.push_back(cast<Instruction>(User.OperandValToReplace));
1918 UsersToProcess.pop_back();
1921 // If there are any more users to process with the same base, process them
1922 // now. We sorted by base above, so we just have to check the last elt.
1923 } while (!UsersToProcess.empty() && UsersToProcess.back().Base == Base);
1924 // TODO: Next, find out which base index is the most common, pull it out.
1927 // IMPORTANT TODO: Figure out how to partition the IV's with this stride, but
1928 // different starting values, into different PHIs.
1931 /// FindIVUserForCond - If Cond has an operand that is an expression of an IV,
1932 /// set the IV user and stride information and return true, otherwise return
1934 bool LoopStrengthReduce::FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse,
1935 const SCEVHandle *&CondStride) {
1936 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e && !CondUse;
1938 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
1939 IVUsesByStride.find(StrideOrder[Stride]);
1940 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
1942 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
1943 E = SI->second.Users.end(); UI != E; ++UI)
1944 if (UI->User == Cond) {
1945 // NOTE: we could handle setcc instructions with multiple uses here, but
1946 // InstCombine does it as well for simple uses, it's not clear that it
1947 // occurs enough in real life to handle.
1949 CondStride = &SI->first;
1957 // Constant strides come first which in turns are sorted by their absolute
1958 // values. If absolute values are the same, then positive strides comes first.
1960 // 4, -1, X, 1, 2 ==> 1, -1, 2, 4, X
1961 struct StrideCompare {
1962 const TargetData *TD;
1963 explicit StrideCompare(const TargetData *td) : TD(td) {}
1965 bool operator()(const SCEVHandle &LHS, const SCEVHandle &RHS) {
1966 SCEVConstant *LHSC = dyn_cast<SCEVConstant>(LHS);
1967 SCEVConstant *RHSC = dyn_cast<SCEVConstant>(RHS);
1969 int64_t LV = LHSC->getValue()->getSExtValue();
1970 int64_t RV = RHSC->getValue()->getSExtValue();
1971 uint64_t ALV = (LV < 0) ? -LV : LV;
1972 uint64_t ARV = (RV < 0) ? -RV : RV;
1980 // If it's the same value but different type, sort by bit width so
1981 // that we emit larger induction variables before smaller
1982 // ones, letting the smaller be re-written in terms of larger ones.
1983 return TD->getTypeSizeInBits(RHS->getType()) <
1984 TD->getTypeSizeInBits(LHS->getType());
1986 return LHSC && !RHSC;
1991 /// ChangeCompareStride - If a loop termination compare instruction is the
1992 /// only use of its stride, and the compaison is against a constant value,
1993 /// try eliminate the stride by moving the compare instruction to another
1994 /// stride and change its constant operand accordingly. e.g.
2000 /// if (v2 < 10) goto loop
2005 /// if (v1 < 30) goto loop
2006 ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
2007 IVStrideUse* &CondUse,
2008 const SCEVHandle* &CondStride) {
2009 if (StrideOrder.size() < 2 ||
2010 IVUsesByStride[*CondStride].Users.size() != 1)
2012 const SCEVConstant *SC = dyn_cast<SCEVConstant>(*CondStride);
2013 if (!SC) return Cond;
2015 ICmpInst::Predicate Predicate = Cond->getPredicate();
2016 int64_t CmpSSInt = SC->getValue()->getSExtValue();
2017 unsigned BitWidth = TD->getTypeSizeInBits((*CondStride)->getType());
2018 uint64_t SignBit = 1ULL << (BitWidth-1);
2019 const Type *CmpTy = Cond->getOperand(0)->getType();
2020 const Type *NewCmpTy = NULL;
2021 unsigned TyBits = TD->getTypeSizeInBits(CmpTy);
2022 unsigned NewTyBits = 0;
2023 SCEVHandle *NewStride = NULL;
2024 Value *NewCmpLHS = NULL;
2025 Value *NewCmpRHS = NULL;
2027 SCEVHandle NewOffset = SE->getIntegerSCEV(0, UIntPtrTy);
2029 if (ConstantInt *C = dyn_cast<ConstantInt>(Cond->getOperand(1))) {
2030 int64_t CmpVal = C->getValue().getSExtValue();
2032 // Check stride constant and the comparision constant signs to detect
2034 if ((CmpVal & SignBit) != (CmpSSInt & SignBit))
2037 // Look for a suitable stride / iv as replacement.
2038 for (unsigned i = 0, e = StrideOrder.size(); i != e; ++i) {
2039 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2040 IVUsesByStride.find(StrideOrder[i]);
2041 if (!isa<SCEVConstant>(SI->first))
2043 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
2044 if (abs(SSInt) <= abs(CmpSSInt) || (SSInt % CmpSSInt) != 0)
2047 Scale = SSInt / CmpSSInt;
2048 int64_t NewCmpVal = CmpVal * Scale;
2049 APInt Mul = APInt(BitWidth, NewCmpVal);
2050 // Check for overflow.
2051 if (Mul.getSExtValue() != NewCmpVal)
2054 // Watch out for overflow.
2055 if (ICmpInst::isSignedPredicate(Predicate) &&
2056 (CmpVal & SignBit) != (NewCmpVal & SignBit))
2059 if (NewCmpVal == CmpVal)
2061 // Pick the best iv to use trying to avoid a cast.
2063 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
2064 E = SI->second.Users.end(); UI != E; ++UI) {
2065 NewCmpLHS = UI->OperandValToReplace;
2066 if (NewCmpLHS->getType() == CmpTy)
2072 NewCmpTy = NewCmpLHS->getType();
2073 NewTyBits = TD->getTypeSizeInBits(NewCmpTy);
2074 if (RequiresTypeConversion(NewCmpTy, CmpTy)) {
2075 // Check if it is possible to rewrite it using
2076 // an iv / stride of a smaller integer type.
2077 unsigned Bits = NewTyBits;
2078 if (ICmpInst::isSignedPredicate(Predicate))
2080 uint64_t Mask = (1ULL << Bits) - 1;
2081 if (((uint64_t)NewCmpVal & Mask) != (uint64_t)NewCmpVal)
2085 // Don't rewrite if use offset is non-constant and the new type is
2086 // of a different type.
2087 // FIXME: too conservative?
2088 if (NewTyBits != TyBits && !isa<SCEVConstant>(CondUse->Offset))
2091 bool AllUsesAreAddresses = true;
2092 bool AllUsesAreOutsideLoop = true;
2093 std::vector<BasedUser> UsersToProcess;
2094 SCEVHandle CommonExprs = CollectIVUsers(SI->first, SI->second, L,
2095 AllUsesAreAddresses,
2096 AllUsesAreOutsideLoop,
2098 // Avoid rewriting the compare instruction with an iv of new stride
2099 // if it's likely the new stride uses will be rewritten using the
2100 // stride of the compare instruction.
2101 if (AllUsesAreAddresses &&
2102 ValidStride(!CommonExprs->isZero(), Scale, UsersToProcess))
2105 // If scale is negative, use swapped predicate unless it's testing
2107 if (Scale < 0 && !Cond->isEquality())
2108 Predicate = ICmpInst::getSwappedPredicate(Predicate);
2110 NewStride = &StrideOrder[i];
2111 if (!isa<PointerType>(NewCmpTy))
2112 NewCmpRHS = ConstantInt::get(NewCmpTy, NewCmpVal);
2114 ConstantInt *CI = ConstantInt::get(UIntPtrTy, NewCmpVal);
2115 NewCmpRHS = ConstantExpr::getIntToPtr(CI, NewCmpTy);
2117 NewOffset = TyBits == NewTyBits
2118 ? SE->getMulExpr(CondUse->Offset,
2119 SE->getConstant(ConstantInt::get(CmpTy, Scale)))
2120 : SE->getConstant(ConstantInt::get(NewCmpTy,
2121 cast<SCEVConstant>(CondUse->Offset)->getValue()->getSExtValue()*Scale));
2126 // Forgo this transformation if it the increment happens to be
2127 // unfortunately positioned after the condition, and the condition
2128 // has multiple uses which prevent it from being moved immediately
2129 // before the branch. See
2130 // test/Transforms/LoopStrengthReduce/change-compare-stride-trickiness-*.ll
2131 // for an example of this situation.
2132 if (!Cond->hasOneUse()) {
2133 for (BasicBlock::iterator I = Cond, E = Cond->getParent()->end();
2140 // Create a new compare instruction using new stride / iv.
2141 ICmpInst *OldCond = Cond;
2142 // Insert new compare instruction.
2143 Cond = new ICmpInst(Predicate, NewCmpLHS, NewCmpRHS,
2144 L->getHeader()->getName() + ".termcond",
2147 // Remove the old compare instruction. The old indvar is probably dead too.
2148 DeadInsts.push_back(cast<Instruction>(CondUse->OperandValToReplace));
2149 SE->deleteValueFromRecords(OldCond);
2150 OldCond->replaceAllUsesWith(Cond);
2151 OldCond->eraseFromParent();
2153 IVUsesByStride[*CondStride].Users.pop_back();
2154 IVUsesByStride[*NewStride].addUser(NewOffset, Cond, NewCmpLHS);
2155 CondUse = &IVUsesByStride[*NewStride].Users.back();
2156 CondStride = NewStride;
2163 /// OptimizeSMax - Rewrite the loop's terminating condition if it uses
2164 /// an smax computation.
2166 /// This is a narrow solution to a specific, but acute, problem. For loops
2172 /// } while (++i < n);
2174 /// where the comparison is signed, the trip count isn't just 'n', because
2175 /// 'n' could be negative. And unfortunately this can come up even for loops
2176 /// where the user didn't use a C do-while loop. For example, seemingly
2177 /// well-behaved top-test loops will commonly be lowered like this:
2183 /// } while (++i < n);
2186 /// and then it's possible for subsequent optimization to obscure the if
2187 /// test in such a way that indvars can't find it.
2189 /// When indvars can't find the if test in loops like this, it creates a
2190 /// signed-max expression, which allows it to give the loop a canonical
2191 /// induction variable:
2194 /// smax = n < 1 ? 1 : n;
2197 /// } while (++i != smax);
2199 /// Canonical induction variables are necessary because the loop passes
2200 /// are designed around them. The most obvious example of this is the
2201 /// LoopInfo analysis, which doesn't remember trip count values. It
2202 /// expects to be able to rediscover the trip count each time it is
2203 /// needed, and it does this using a simple analyis that only succeeds if
2204 /// the loop has a canonical induction variable.
2206 /// However, when it comes time to generate code, the maximum operation
2207 /// can be quite costly, especially if it's inside of an outer loop.
2209 /// This function solves this problem by detecting this type of loop and
2210 /// rewriting their conditions from ICMP_NE back to ICMP_SLT, and deleting
2211 /// the instructions for the maximum computation.
2213 ICmpInst *LoopStrengthReduce::OptimizeSMax(Loop *L, ICmpInst *Cond,
2214 IVStrideUse* &CondUse) {
2215 // Check that the loop matches the pattern we're looking for.
2216 if (Cond->getPredicate() != CmpInst::ICMP_EQ &&
2217 Cond->getPredicate() != CmpInst::ICMP_NE)
2220 SelectInst *Sel = dyn_cast<SelectInst>(Cond->getOperand(1));
2221 if (!Sel || !Sel->hasOneUse()) return Cond;
2223 SCEVHandle BackedgeTakenCount = SE->getBackedgeTakenCount(L);
2224 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
2226 SCEVHandle One = SE->getIntegerSCEV(1, BackedgeTakenCount->getType());
2228 // Add one to the backedge-taken count to get the trip count.
2229 SCEVHandle IterationCount = SE->getAddExpr(BackedgeTakenCount, One);
2231 // Check for a max calculation that matches the pattern.
2232 SCEVSMaxExpr *SMax = dyn_cast<SCEVSMaxExpr>(IterationCount);
2233 if (!SMax || SMax != SE->getSCEV(Sel)) return Cond;
2235 SCEVHandle SMaxLHS = SMax->getOperand(0);
2236 SCEVHandle SMaxRHS = SMax->getOperand(1);
2237 if (!SMaxLHS || SMaxLHS != One) return Cond;
2239 // Check the relevant induction variable for conformance to
2241 SCEVHandle IV = SE->getSCEV(Cond->getOperand(0));
2242 SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV);
2243 if (!AR || !AR->isAffine() ||
2244 AR->getStart() != One ||
2245 AR->getStepRecurrence(*SE) != One)
2248 assert(AR->getLoop() == L &&
2249 "Loop condition operand is an addrec in a different loop!");
2251 // Check the right operand of the select, and remember it, as it will
2252 // be used in the new comparison instruction.
2254 if (SE->getSCEV(Sel->getOperand(1)) == SMaxRHS)
2255 NewRHS = Sel->getOperand(1);
2256 else if (SE->getSCEV(Sel->getOperand(2)) == SMaxRHS)
2257 NewRHS = Sel->getOperand(2);
2258 if (!NewRHS) return Cond;
2260 // Ok, everything looks ok to change the condition into an SLT or SGE and
2261 // delete the max calculation.
2263 new ICmpInst(Cond->getPredicate() == CmpInst::ICMP_NE ?
2266 Cond->getOperand(0), NewRHS, "scmp", Cond);
2268 // Delete the max calculation instructions.
2269 SE->deleteValueFromRecords(Cond);
2270 Cond->replaceAllUsesWith(NewCond);
2271 Cond->eraseFromParent();
2272 Instruction *Cmp = cast<Instruction>(Sel->getOperand(0));
2273 SE->deleteValueFromRecords(Sel);
2274 Sel->eraseFromParent();
2275 if (Cmp->use_empty()) {
2276 SE->deleteValueFromRecords(Cmp);
2277 Cmp->eraseFromParent();
2279 CondUse->User = NewCond;
2283 /// OptimizeShadowIV - If IV is used in a int-to-float cast
2284 /// inside the loop then try to eliminate the cast opeation.
2285 void LoopStrengthReduce::OptimizeShadowIV(Loop *L) {
2287 SCEVHandle BackedgeTakenCount = SE->getBackedgeTakenCount(L);
2288 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
2291 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e;
2293 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2294 IVUsesByStride.find(StrideOrder[Stride]);
2295 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
2296 if (!isa<SCEVConstant>(SI->first))
2299 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
2300 E = SI->second.Users.end(); UI != E; /* empty */) {
2301 std::vector<IVStrideUse>::iterator CandidateUI = UI;
2303 Instruction *ShadowUse = CandidateUI->User;
2304 const Type *DestTy = NULL;
2306 /* If shadow use is a int->float cast then insert a second IV
2307 to eliminate this cast.
2309 for (unsigned i = 0; i < n; ++i)
2315 for (unsigned i = 0; i < n; ++i, ++d)
2318 if (UIToFPInst *UCast = dyn_cast<UIToFPInst>(CandidateUI->User))
2319 DestTy = UCast->getDestTy();
2320 else if (SIToFPInst *SCast = dyn_cast<SIToFPInst>(CandidateUI->User))
2321 DestTy = SCast->getDestTy();
2322 if (!DestTy) continue;
2325 /* If target does not support DestTy natively then do not apply
2326 this transformation. */
2327 MVT DVT = TLI->getValueType(DestTy);
2328 if (!TLI->isTypeLegal(DVT)) continue;
2331 PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0));
2333 if (PH->getNumIncomingValues() != 2) continue;
2335 const Type *SrcTy = PH->getType();
2336 int Mantissa = DestTy->getFPMantissaWidth();
2337 if (Mantissa == -1) continue;
2338 if ((int)TD->getTypeSizeInBits(SrcTy) > Mantissa)
2341 unsigned Entry, Latch;
2342 if (PH->getIncomingBlock(0) == L->getLoopPreheader()) {
2350 ConstantInt *Init = dyn_cast<ConstantInt>(PH->getIncomingValue(Entry));
2351 if (!Init) continue;
2352 ConstantFP *NewInit = ConstantFP::get(DestTy, Init->getZExtValue());
2354 BinaryOperator *Incr =
2355 dyn_cast<BinaryOperator>(PH->getIncomingValue(Latch));
2356 if (!Incr) continue;
2357 if (Incr->getOpcode() != Instruction::Add
2358 && Incr->getOpcode() != Instruction::Sub)
2361 /* Initialize new IV, double d = 0.0 in above example. */
2362 ConstantInt *C = NULL;
2363 if (Incr->getOperand(0) == PH)
2364 C = dyn_cast<ConstantInt>(Incr->getOperand(1));
2365 else if (Incr->getOperand(1) == PH)
2366 C = dyn_cast<ConstantInt>(Incr->getOperand(0));
2372 /* Add new PHINode. */
2373 PHINode *NewPH = PHINode::Create(DestTy, "IV.S.", PH);
2375 /* create new increment. '++d' in above example. */
2376 ConstantFP *CFP = ConstantFP::get(DestTy, C->getZExtValue());
2377 BinaryOperator *NewIncr =
2378 BinaryOperator::Create(Incr->getOpcode(),
2379 NewPH, CFP, "IV.S.next.", Incr);
2381 NewPH->addIncoming(NewInit, PH->getIncomingBlock(Entry));
2382 NewPH->addIncoming(NewIncr, PH->getIncomingBlock(Latch));
2384 /* Remove cast operation */
2385 SE->deleteValueFromRecords(ShadowUse);
2386 ShadowUse->replaceAllUsesWith(NewPH);
2387 ShadowUse->eraseFromParent();
2388 SI->second.Users.erase(CandidateUI);
2395 // OptimizeIndvars - Now that IVUsesByStride is set up with all of the indvar
2396 // uses in the loop, look to see if we can eliminate some, in favor of using
2397 // common indvars for the different uses.
2398 void LoopStrengthReduce::OptimizeIndvars(Loop *L) {
2399 // TODO: implement optzns here.
2401 OptimizeShadowIV(L);
2403 // Finally, get the terminating condition for the loop if possible. If we
2404 // can, we want to change it to use a post-incremented version of its
2405 // induction variable, to allow coalescing the live ranges for the IV into
2406 // one register value.
2407 PHINode *SomePHI = cast<PHINode>(L->getHeader()->begin());
2408 BasicBlock *Preheader = L->getLoopPreheader();
2409 BasicBlock *LatchBlock =
2410 SomePHI->getIncomingBlock(SomePHI->getIncomingBlock(0) == Preheader);
2411 BranchInst *TermBr = dyn_cast<BranchInst>(LatchBlock->getTerminator());
2412 if (!TermBr || TermBr->isUnconditional() ||
2413 !isa<ICmpInst>(TermBr->getCondition()))
2415 ICmpInst *Cond = cast<ICmpInst>(TermBr->getCondition());
2417 // Search IVUsesByStride to find Cond's IVUse if there is one.
2418 IVStrideUse *CondUse = 0;
2419 const SCEVHandle *CondStride = 0;
2421 if (!FindIVUserForCond(Cond, CondUse, CondStride))
2422 return; // setcc doesn't use the IV.
2424 // If the trip count is computed in terms of an smax (due to ScalarEvolution
2425 // being unable to find a sufficient guard, for example), change the loop
2426 // comparison to use SLT instead of NE.
2427 Cond = OptimizeSMax(L, Cond, CondUse);
2429 // If possible, change stride and operands of the compare instruction to
2430 // eliminate one stride.
2431 Cond = ChangeCompareStride(L, Cond, CondUse, CondStride);
2433 // It's possible for the setcc instruction to be anywhere in the loop, and
2434 // possible for it to have multiple users. If it is not immediately before
2435 // the latch block branch, move it.
2436 if (&*++BasicBlock::iterator(Cond) != (Instruction*)TermBr) {
2437 if (Cond->hasOneUse()) { // Condition has a single use, just move it.
2438 Cond->moveBefore(TermBr);
2440 // Otherwise, clone the terminating condition and insert into the loopend.
2441 Cond = cast<ICmpInst>(Cond->clone());
2442 Cond->setName(L->getHeader()->getName() + ".termcond");
2443 LatchBlock->getInstList().insert(TermBr, Cond);
2445 // Clone the IVUse, as the old use still exists!
2446 IVUsesByStride[*CondStride].addUser(CondUse->Offset, Cond,
2447 CondUse->OperandValToReplace);
2448 CondUse = &IVUsesByStride[*CondStride].Users.back();
2452 // If we get to here, we know that we can transform the setcc instruction to
2453 // use the post-incremented version of the IV, allowing us to coalesce the
2454 // live ranges for the IV correctly.
2455 CondUse->Offset = SE->getMinusSCEV(CondUse->Offset, *CondStride);
2456 CondUse->isUseOfPostIncrementedValue = true;
2460 bool LoopStrengthReduce::runOnLoop(Loop *L, LPPassManager &LPM) {
2462 LI = &getAnalysis<LoopInfo>();
2463 DT = &getAnalysis<DominatorTree>();
2464 SE = &getAnalysis<ScalarEvolution>();
2465 TD = &getAnalysis<TargetData>();
2466 UIntPtrTy = TD->getIntPtrType();
2469 // Find all uses of induction variables in this loop, and categorize
2470 // them by stride. Start by finding all of the PHI nodes in the header for
2471 // this loop. If they are induction variables, inspect their uses.
2472 SmallPtrSet<Instruction*,16> Processed; // Don't reprocess instructions.
2473 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I)
2474 AddUsersIfInteresting(I, L, Processed);
2476 if (!IVUsesByStride.empty()) {
2478 DOUT << "\nLSR on \"" << L->getHeader()->getParent()->getNameStart()
2483 // Sort the StrideOrder so we process larger strides first.
2484 std::stable_sort(StrideOrder.begin(), StrideOrder.end(), StrideCompare(TD));
2486 // Optimize induction variables. Some indvar uses can be transformed to use
2487 // strides that will be needed for other purposes. A common example of this
2488 // is the exit test for the loop, which can often be rewritten to use the
2489 // computation of some other indvar to decide when to terminate the loop.
2492 // FIXME: We can widen subreg IV's here for RISC targets. e.g. instead of
2493 // doing computation in byte values, promote to 32-bit values if safe.
2495 // FIXME: Attempt to reuse values across multiple IV's. In particular, we
2496 // could have something like "for(i) { foo(i*8); bar(i*16) }", which should
2497 // be codegened as "for (j = 0;; j+=8) { foo(j); bar(j+j); }" on X86/PPC.
2498 // Need to be careful that IV's are all the same type. Only works for
2499 // intptr_t indvars.
2501 // IVsByStride keeps IVs for one particular loop.
2502 assert(IVsByStride.empty() && "Stale entries in IVsByStride?");
2504 // Note: this processes each stride/type pair individually. All users
2505 // passed into StrengthReduceStridedIVUsers have the same type AND stride.
2506 // Also, note that we iterate over IVUsesByStride indirectly by using
2507 // StrideOrder. This extra layer of indirection makes the ordering of
2508 // strides deterministic - not dependent on map order.
2509 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e; ++Stride) {
2510 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2511 IVUsesByStride.find(StrideOrder[Stride]);
2512 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
2513 StrengthReduceStridedIVUsers(SI->first, SI->second, L);
2517 // We're done analyzing this loop; release all the state we built up for it.
2518 IVUsesByStride.clear();
2519 IVsByStride.clear();
2520 StrideOrder.clear();
2522 // Clean up after ourselves
2523 if (!DeadInsts.empty()) {
2524 DeleteTriviallyDeadInstructions();
2526 BasicBlock::iterator I = L->getHeader()->begin();
2527 while (PHINode *PN = dyn_cast<PHINode>(I++)) {
2528 // At this point, we know that we have killed one or more IV users.
2529 // It is worth checking to see if the cannonical indvar is also
2530 // dead, so that we can remove it as well.
2532 // We can remove a PHI if it is on a cycle in the def-use graph
2533 // where each node in the cycle has degree one, i.e. only one use,
2534 // and is an instruction with no side effects.
2536 // FIXME: this needs to eliminate an induction variable even if it's being
2537 // compared against some value to decide loop termination.
2538 if (!PN->hasOneUse())
2541 SmallPtrSet<PHINode *, 4> PHIs;
2542 for (Instruction *J = dyn_cast<Instruction>(*PN->use_begin());
2543 J && J->hasOneUse() && !J->mayWriteToMemory();
2544 J = dyn_cast<Instruction>(*J->use_begin())) {
2545 // If we find the original PHI, we've discovered a cycle.
2547 // Break the cycle and mark the PHI for deletion.
2548 SE->deleteValueFromRecords(PN);
2549 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
2550 DeadInsts.push_back(PN);
2554 // If we find a PHI more than once, we're on a cycle that
2555 // won't prove fruitful.
2556 if (isa<PHINode>(J) && !PHIs.insert(cast<PHINode>(J)))
2560 DeleteTriviallyDeadInstructions();