1 //===- LoopStrengthReduce.cpp - Strength Reduce GEPs 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. This is
12 // accomplished by creating a new Value to hold the initial value of the array
13 // access for the first iteration, and then creating a new GEP instruction in
14 // the loop to increment the value by the appropriate amount.
16 //===----------------------------------------------------------------------===//
18 #define DEBUG_TYPE "loop-reduce"
19 #include "llvm/Transforms/Scalar.h"
20 #include "llvm/Constants.h"
21 #include "llvm/Instructions.h"
22 #include "llvm/IntrinsicInst.h"
23 #include "llvm/Type.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/Analysis/Dominators.h"
26 #include "llvm/Analysis/LoopInfo.h"
27 #include "llvm/Analysis/LoopPass.h"
28 #include "llvm/Analysis/ScalarEvolutionExpander.h"
29 #include "llvm/Transforms/Utils/AddrModeMatcher.h"
30 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
31 #include "llvm/Transforms/Utils/Local.h"
32 #include "llvm/Target/TargetData.h"
33 #include "llvm/ADT/SmallPtrSet.h"
34 #include "llvm/ADT/Statistic.h"
35 #include "llvm/Support/CFG.h"
36 #include "llvm/Support/Debug.h"
37 #include "llvm/Support/Compiler.h"
38 #include "llvm/Support/CommandLine.h"
39 #include "llvm/Support/GetElementPtrTypeIterator.h"
40 #include "llvm/Target/TargetLowering.h"
44 STATISTIC(NumReduced , "Number of GEPs strength reduced");
45 STATISTIC(NumInserted, "Number of PHIs inserted");
46 STATISTIC(NumVariable, "Number of PHIs with variable strides");
47 STATISTIC(NumEliminated, "Number of strides eliminated");
48 STATISTIC(NumShadow, "Number of Shadow IVs optimized");
49 STATISTIC(NumImmSunk, "Number of common expr immediates sunk into uses");
51 static cl::opt<bool> EnableFullLSRMode("enable-full-lsr",
59 /// IVStrideUse - Keep track of one use of a strided induction variable, where
60 /// the stride is stored externally. The Offset member keeps track of the
61 /// offset from the IV, User is the actual user of the operand, and
62 /// 'OperandValToReplace' is the operand of the User that is the use.
63 struct VISIBILITY_HIDDEN IVStrideUse {
66 Value *OperandValToReplace;
68 // isUseOfPostIncrementedValue - True if this should use the
69 // post-incremented version of this IV, not the preincremented version.
70 // This can only be set in special cases, such as the terminating setcc
71 // instruction for a loop or uses dominated by the loop.
72 bool isUseOfPostIncrementedValue;
74 IVStrideUse(const SCEVHandle &Offs, Instruction *U, Value *O)
75 : Offset(Offs), User(U), OperandValToReplace(O),
76 isUseOfPostIncrementedValue(false) {}
79 /// IVUsersOfOneStride - This structure keeps track of all instructions that
80 /// have an operand that is based on the trip count multiplied by some stride.
81 /// The stride for all of these users is common and kept external to this
83 struct VISIBILITY_HIDDEN IVUsersOfOneStride {
84 /// Users - Keep track of all of the users of this stride as well as the
85 /// initial value and the operand that uses the IV.
86 std::vector<IVStrideUse> Users;
88 void addUser(const SCEVHandle &Offset,Instruction *User, Value *Operand) {
89 Users.push_back(IVStrideUse(Offset, User, Operand));
93 /// IVInfo - This structure keeps track of one IV expression inserted during
94 /// StrengthReduceStridedIVUsers. It contains the stride, the common base, as
95 /// well as the PHI node and increment value created for rewrite.
96 struct VISIBILITY_HIDDEN IVExpr {
101 IVExpr(const SCEVHandle &stride, const SCEVHandle &base, PHINode *phi)
102 : Stride(stride), Base(base), PHI(phi) {}
105 /// IVsOfOneStride - This structure keeps track of all IV expression inserted
106 /// during StrengthReduceStridedIVUsers for a particular stride of the IV.
107 struct VISIBILITY_HIDDEN IVsOfOneStride {
108 std::vector<IVExpr> IVs;
110 void addIV(const SCEVHandle &Stride, const SCEVHandle &Base, PHINode *PHI) {
111 IVs.push_back(IVExpr(Stride, Base, PHI));
115 class VISIBILITY_HIDDEN LoopStrengthReduce : public LoopPass {
119 const TargetData *TD;
120 const Type *UIntPtrTy;
123 /// IVUsesByStride - Keep track of all uses of induction variables that we
124 /// are interested in. The key of the map is the stride of the access.
125 std::map<SCEVHandle, IVUsersOfOneStride> IVUsesByStride;
127 /// IVsByStride - Keep track of all IVs that have been inserted for a
128 /// particular stride.
129 std::map<SCEVHandle, IVsOfOneStride> IVsByStride;
131 /// StrideOrder - An ordering of the keys in IVUsesByStride that is stable:
132 /// We use this to iterate over the IVUsesByStride collection without being
133 /// dependent on random ordering of pointers in the process.
134 SmallVector<SCEVHandle, 16> StrideOrder;
136 /// GEPlist - A list of the GEP's that have been remembered in the SCEV
137 /// data structures. SCEV does not know to update these when the operands
138 /// of the GEP are changed, which means we cannot leave them live across
140 SmallVector<GetElementPtrInst *, 16> GEPlist;
142 /// CastedValues - As we need to cast values to uintptr_t, this keeps track
143 /// of the casted version of each value. This is accessed by
144 /// getCastedVersionOf.
145 DenseMap<Value*, Value*> CastedPointers;
147 /// DeadInsts - Keep track of instructions we may have made dead, so that
148 /// we can remove them after we are done working.
149 SmallVector<Instruction*, 16> DeadInsts;
151 /// TLI - Keep a pointer of a TargetLowering to consult for determining
152 /// transformation profitability.
153 const TargetLowering *TLI;
156 static char ID; // Pass ID, replacement for typeid
157 explicit LoopStrengthReduce(const TargetLowering *tli = NULL) :
158 LoopPass(&ID), TLI(tli) {
161 bool runOnLoop(Loop *L, LPPassManager &LPM);
163 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
164 // We split critical edges, so we change the CFG. However, we do update
165 // many analyses if they are around.
166 AU.addPreservedID(LoopSimplifyID);
167 AU.addPreserved<LoopInfo>();
168 AU.addPreserved<DominanceFrontier>();
169 AU.addPreserved<DominatorTree>();
171 AU.addRequiredID(LoopSimplifyID);
172 AU.addRequired<LoopInfo>();
173 AU.addRequired<DominatorTree>();
174 AU.addRequired<TargetData>();
175 AU.addRequired<ScalarEvolution>();
176 AU.addPreserved<ScalarEvolution>();
179 /// getCastedVersionOf - Return the specified value casted to uintptr_t.
181 Value *getCastedVersionOf(Instruction::CastOps opcode, Value *V);
183 bool AddUsersIfInteresting(Instruction *I, Loop *L,
184 SmallPtrSet<Instruction*,16> &Processed);
185 SCEVHandle GetExpressionSCEV(Instruction *E);
186 ICmpInst *ChangeCompareStride(Loop *L, ICmpInst *Cond,
187 IVStrideUse* &CondUse,
188 const SCEVHandle* &CondStride);
189 void OptimizeIndvars(Loop *L);
191 /// OptimizeShadowIV - If IV is used in a int-to-float cast
192 /// inside the loop then try to eliminate the cast opeation.
193 void OptimizeShadowIV(Loop *L);
195 /// OptimizeSMax - Rewrite the loop's terminating condition
196 /// if it uses an smax computation.
197 ICmpInst *OptimizeSMax(Loop *L, ICmpInst *Cond,
198 IVStrideUse* &CondUse);
200 bool FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse,
201 const SCEVHandle *&CondStride);
202 bool RequiresTypeConversion(const Type *Ty, const Type *NewTy);
203 SCEVHandle CheckForIVReuse(bool, bool, bool, const SCEVHandle&,
204 IVExpr&, const Type*,
205 const std::vector<BasedUser>& UsersToProcess);
206 bool ValidStride(bool, int64_t,
207 const std::vector<BasedUser>& UsersToProcess);
208 SCEVHandle CollectIVUsers(const SCEVHandle &Stride,
209 IVUsersOfOneStride &Uses,
211 bool &AllUsesAreAddresses,
212 bool &AllUsesAreOutsideLoop,
213 std::vector<BasedUser> &UsersToProcess);
214 bool ShouldUseFullStrengthReductionMode(
215 const std::vector<BasedUser> &UsersToProcess,
217 bool AllUsesAreAddresses,
219 void PrepareToStrengthReduceFully(
220 std::vector<BasedUser> &UsersToProcess,
222 SCEVHandle CommonExprs,
224 SCEVExpander &PreheaderRewriter);
225 void PrepareToStrengthReduceFromSmallerStride(
226 std::vector<BasedUser> &UsersToProcess,
228 const IVExpr &ReuseIV,
229 Instruction *PreInsertPt);
230 void PrepareToStrengthReduceWithNewPhi(
231 std::vector<BasedUser> &UsersToProcess,
233 SCEVHandle CommonExprs,
236 SCEVExpander &PreheaderRewriter);
237 void StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
238 IVUsersOfOneStride &Uses,
240 void DeleteTriviallyDeadInstructions();
244 char LoopStrengthReduce::ID = 0;
245 static RegisterPass<LoopStrengthReduce>
246 X("loop-reduce", "Loop Strength Reduction");
248 Pass *llvm::createLoopStrengthReducePass(const TargetLowering *TLI) {
249 return new LoopStrengthReduce(TLI);
252 /// getCastedVersionOf - Return the specified value casted to uintptr_t. This
253 /// assumes that the Value* V is of integer or pointer type only.
255 Value *LoopStrengthReduce::getCastedVersionOf(Instruction::CastOps opcode,
257 if (V->getType() == UIntPtrTy) return V;
258 if (Constant *CB = dyn_cast<Constant>(V))
259 return ConstantExpr::getCast(opcode, CB, UIntPtrTy);
261 Value *&New = CastedPointers[V];
264 New = SCEVExpander::InsertCastOfTo(opcode, V, UIntPtrTy);
265 DeadInsts.push_back(cast<Instruction>(New));
270 /// DeleteTriviallyDeadInstructions - If any of the instructions is the
271 /// specified set are trivially dead, delete them and see if this makes any of
272 /// their operands subsequently dead.
273 void LoopStrengthReduce::DeleteTriviallyDeadInstructions() {
274 if (DeadInsts.empty()) return;
276 // Sort the deadinsts list so that we can trivially eliminate duplicates as we
277 // go. The code below never adds a non-dead instruction to the worklist, but
278 // callers may not be so careful.
279 array_pod_sort(DeadInsts.begin(), DeadInsts.end());
281 // Drop duplicate instructions and those with uses.
282 for (unsigned i = 0, e = DeadInsts.size()-1; i < e; ++i) {
283 Instruction *I = DeadInsts[i];
284 if (!I->use_empty()) DeadInsts[i] = 0;
285 while (i != e && DeadInsts[i+1] == I)
289 while (!DeadInsts.empty()) {
290 Instruction *I = DeadInsts.back();
291 DeadInsts.pop_back();
293 if (I == 0 || !isInstructionTriviallyDead(I))
296 SE->deleteValueFromRecords(I);
298 for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI) {
299 if (Instruction *U = dyn_cast<Instruction>(*OI)) {
302 DeadInsts.push_back(U);
306 I->eraseFromParent();
312 /// GetExpressionSCEV - Compute and return the SCEV for the specified
314 SCEVHandle LoopStrengthReduce::GetExpressionSCEV(Instruction *Exp) {
315 // Pointer to pointer bitcast instructions return the same value as their
317 if (BitCastInst *BCI = dyn_cast<BitCastInst>(Exp)) {
318 if (SE->hasSCEV(BCI) || !isa<Instruction>(BCI->getOperand(0)))
319 return SE->getSCEV(BCI);
320 SCEVHandle R = GetExpressionSCEV(cast<Instruction>(BCI->getOperand(0)));
325 // Scalar Evolutions doesn't know how to compute SCEV's for GEP instructions.
326 // If this is a GEP that SE doesn't know about, compute it now and insert it.
327 // If this is not a GEP, or if we have already done this computation, just let
329 GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Exp);
330 if (!GEP || SE->hasSCEV(GEP))
331 return SE->getSCEV(Exp);
333 // Analyze all of the subscripts of this getelementptr instruction, looking
334 // for uses that are determined by the trip count of the loop. First, skip
335 // all operands the are not dependent on the IV.
337 // Build up the base expression. Insert an LLVM cast of the pointer to
339 SCEVHandle GEPVal = SE->getUnknown(
340 getCastedVersionOf(Instruction::PtrToInt, GEP->getOperand(0)));
342 gep_type_iterator GTI = gep_type_begin(GEP);
344 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end();
345 i != e; ++i, ++GTI) {
346 // If this is a use of a recurrence that we can analyze, and it comes before
347 // Op does in the GEP operand list, we will handle this when we process this
349 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
350 const StructLayout *SL = TD->getStructLayout(STy);
351 unsigned Idx = cast<ConstantInt>(*i)->getZExtValue();
352 uint64_t Offset = SL->getElementOffset(Idx);
353 GEPVal = SE->getAddExpr(GEPVal,
354 SE->getIntegerSCEV(Offset, UIntPtrTy));
356 unsigned GEPOpiBits =
357 (*i)->getType()->getPrimitiveSizeInBits();
358 unsigned IntPtrBits = UIntPtrTy->getPrimitiveSizeInBits();
359 Instruction::CastOps opcode = (GEPOpiBits < IntPtrBits ?
360 Instruction::SExt : (GEPOpiBits > IntPtrBits ? Instruction::Trunc :
361 Instruction::BitCast));
362 Value *OpVal = getCastedVersionOf(opcode, *i);
363 SCEVHandle Idx = SE->getSCEV(OpVal);
365 uint64_t TypeSize = TD->getTypePaddedSize(GTI.getIndexedType());
367 Idx = SE->getMulExpr(Idx,
368 SE->getConstant(ConstantInt::get(UIntPtrTy,
370 GEPVal = SE->getAddExpr(GEPVal, Idx);
374 SE->setSCEV(GEP, GEPVal);
375 GEPlist.push_back(GEP);
379 /// containsAddRecFromDifferentLoop - Determine whether expression S involves a
380 /// subexpression that is an AddRec from a loop other than L. An outer loop
381 /// of L is OK, but not an inner loop nor a disjoint loop.
382 static bool containsAddRecFromDifferentLoop(SCEVHandle S, Loop *L) {
383 // This is very common, put it first.
384 if (isa<SCEVConstant>(S))
386 if (SCEVCommutativeExpr *AE = dyn_cast<SCEVCommutativeExpr>(S)) {
387 for (unsigned int i=0; i< AE->getNumOperands(); i++)
388 if (containsAddRecFromDifferentLoop(AE->getOperand(i), L))
392 if (SCEVAddRecExpr *AE = dyn_cast<SCEVAddRecExpr>(S)) {
393 if (const Loop *newLoop = AE->getLoop()) {
396 // if newLoop is an outer loop of L, this is OK.
397 if (!LoopInfoBase<BasicBlock>::isNotAlreadyContainedIn(L, newLoop))
402 if (SCEVUDivExpr *DE = dyn_cast<SCEVUDivExpr>(S))
403 return containsAddRecFromDifferentLoop(DE->getLHS(), L) ||
404 containsAddRecFromDifferentLoop(DE->getRHS(), L);
406 // SCEVSDivExpr has been backed out temporarily, but will be back; we'll
407 // need this when it is.
408 if (SCEVSDivExpr *DE = dyn_cast<SCEVSDivExpr>(S))
409 return containsAddRecFromDifferentLoop(DE->getLHS(), L) ||
410 containsAddRecFromDifferentLoop(DE->getRHS(), L);
412 if (SCEVTruncateExpr *TE = dyn_cast<SCEVTruncateExpr>(S))
413 return containsAddRecFromDifferentLoop(TE->getOperand(), L);
414 if (SCEVZeroExtendExpr *ZE = dyn_cast<SCEVZeroExtendExpr>(S))
415 return containsAddRecFromDifferentLoop(ZE->getOperand(), L);
416 if (SCEVSignExtendExpr *SE = dyn_cast<SCEVSignExtendExpr>(S))
417 return containsAddRecFromDifferentLoop(SE->getOperand(), L);
421 /// getSCEVStartAndStride - Compute the start and stride of this expression,
422 /// returning false if the expression is not a start/stride pair, or true if it
423 /// is. The stride must be a loop invariant expression, but the start may be
424 /// a mix of loop invariant and loop variant expressions. The start cannot,
425 /// however, contain an AddRec from a different loop, unless that loop is an
426 /// outer loop of the current loop.
427 static bool getSCEVStartAndStride(const SCEVHandle &SH, Loop *L,
428 SCEVHandle &Start, SCEVHandle &Stride,
429 ScalarEvolution *SE, DominatorTree *DT) {
430 SCEVHandle TheAddRec = Start; // Initialize to zero.
432 // If the outer level is an AddExpr, the operands are all start values except
433 // for a nested AddRecExpr.
434 if (SCEVAddExpr *AE = dyn_cast<SCEVAddExpr>(SH)) {
435 for (unsigned i = 0, e = AE->getNumOperands(); i != e; ++i)
436 if (SCEVAddRecExpr *AddRec =
437 dyn_cast<SCEVAddRecExpr>(AE->getOperand(i))) {
438 if (AddRec->getLoop() == L)
439 TheAddRec = SE->getAddExpr(AddRec, TheAddRec);
441 return false; // Nested IV of some sort?
443 Start = SE->getAddExpr(Start, AE->getOperand(i));
446 } else if (isa<SCEVAddRecExpr>(SH)) {
449 return false; // not analyzable.
452 SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(TheAddRec);
453 if (!AddRec || AddRec->getLoop() != L) return false;
455 // FIXME: Generalize to non-affine IV's.
456 if (!AddRec->isAffine()) return false;
458 // If Start contains an SCEVAddRecExpr from a different loop, other than an
459 // outer loop of the current loop, reject it. SCEV has no concept of
460 // operating on more than one loop at a time so don't confuse it with such
462 if (containsAddRecFromDifferentLoop(AddRec->getOperand(0), L))
465 Start = SE->getAddExpr(Start, AddRec->getOperand(0));
467 if (!isa<SCEVConstant>(AddRec->getOperand(1))) {
468 // If stride is an instruction, make sure it dominates the loop preheader.
469 // Otherwise we could end up with a use before def situation.
470 BasicBlock *Preheader = L->getLoopPreheader();
471 if (!AddRec->getOperand(1)->dominates(Preheader, DT))
474 DOUT << "[" << L->getHeader()->getName()
475 << "] Variable stride: " << *AddRec << "\n";
478 Stride = AddRec->getOperand(1);
482 /// IVUseShouldUsePostIncValue - We have discovered a "User" of an IV expression
483 /// and now we need to decide whether the user should use the preinc or post-inc
484 /// value. If this user should use the post-inc version of the IV, return true.
486 /// Choosing wrong here can break dominance properties (if we choose to use the
487 /// post-inc value when we cannot) or it can end up adding extra live-ranges to
488 /// the loop, resulting in reg-reg copies (if we use the pre-inc value when we
489 /// should use the post-inc value).
490 static bool IVUseShouldUsePostIncValue(Instruction *User, Instruction *IV,
491 Loop *L, DominatorTree *DT, Pass *P,
492 SmallVectorImpl<Instruction*> &DeadInsts){
493 // If the user is in the loop, use the preinc value.
494 if (L->contains(User->getParent())) return false;
496 BasicBlock *LatchBlock = L->getLoopLatch();
498 // Ok, the user is outside of the loop. If it is dominated by the latch
499 // block, use the post-inc value.
500 if (DT->dominates(LatchBlock, User->getParent()))
503 // There is one case we have to be careful of: PHI nodes. These little guys
504 // can live in blocks that do not dominate the latch block, but (since their
505 // uses occur in the predecessor block, not the block the PHI lives in) should
506 // still use the post-inc value. Check for this case now.
507 PHINode *PN = dyn_cast<PHINode>(User);
508 if (!PN) return false; // not a phi, not dominated by latch block.
510 // Look at all of the uses of IV by the PHI node. If any use corresponds to
511 // a block that is not dominated by the latch block, give up and use the
512 // preincremented value.
513 unsigned NumUses = 0;
514 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
515 if (PN->getIncomingValue(i) == IV) {
517 if (!DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
521 // Okay, all uses of IV by PN are in predecessor blocks that really are
522 // dominated by the latch block. Split the critical edges and use the
523 // post-incremented value.
524 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
525 if (PN->getIncomingValue(i) == IV) {
526 SplitCriticalEdge(PN->getIncomingBlock(i), PN->getParent(), P, false);
527 // Splitting the critical edge can reduce the number of entries in this
529 e = PN->getNumIncomingValues();
530 if (--NumUses == 0) break;
533 // PHI node might have become a constant value after SplitCriticalEdge.
534 DeadInsts.push_back(User);
539 /// isAddressUse - Returns true if the specified instruction is using the
540 /// specified value as an address.
541 static bool isAddressUse(Instruction *Inst, Value *OperandVal) {
542 bool isAddress = isa<LoadInst>(Inst);
543 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
544 if (SI->getOperand(1) == OperandVal)
546 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
547 // Addressing modes can also be folded into prefetches and a variety
549 switch (II->getIntrinsicID()) {
551 case Intrinsic::prefetch:
552 case Intrinsic::x86_sse2_loadu_dq:
553 case Intrinsic::x86_sse2_loadu_pd:
554 case Intrinsic::x86_sse_loadu_ps:
555 case Intrinsic::x86_sse_storeu_ps:
556 case Intrinsic::x86_sse2_storeu_pd:
557 case Intrinsic::x86_sse2_storeu_dq:
558 case Intrinsic::x86_sse2_storel_dq:
559 if (II->getOperand(1) == OperandVal)
567 /// getAccessType - Return the type of the memory being accessed.
568 static const Type *getAccessType(const Instruction *Inst) {
569 const Type *UseTy = Inst->getType();
570 if (const StoreInst *SI = dyn_cast<StoreInst>(Inst))
571 UseTy = SI->getOperand(0)->getType();
572 else if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
573 // Addressing modes can also be folded into prefetches and a variety
575 switch (II->getIntrinsicID()) {
577 case Intrinsic::x86_sse_storeu_ps:
578 case Intrinsic::x86_sse2_storeu_pd:
579 case Intrinsic::x86_sse2_storeu_dq:
580 case Intrinsic::x86_sse2_storel_dq:
581 UseTy = II->getOperand(1)->getType();
588 /// AddUsersIfInteresting - Inspect the specified instruction. If it is a
589 /// reducible SCEV, recursively add its users to the IVUsesByStride set and
590 /// return true. Otherwise, return false.
591 bool LoopStrengthReduce::AddUsersIfInteresting(Instruction *I, Loop *L,
592 SmallPtrSet<Instruction*,16> &Processed) {
593 if (!I->getType()->isInteger() && !isa<PointerType>(I->getType()))
594 return false; // Void and FP expressions cannot be reduced.
596 // LSR is not APInt clean, do not touch integers bigger than 64-bits.
597 if (I->getType()->isInteger() &&
598 I->getType()->getPrimitiveSizeInBits() > 64)
601 if (!Processed.insert(I))
602 return true; // Instruction already handled.
604 // Get the symbolic expression for this instruction.
605 SCEVHandle ISE = GetExpressionSCEV(I);
606 if (isa<SCEVCouldNotCompute>(ISE)) return false;
608 // Get the start and stride for this expression.
609 SCEVHandle Start = SE->getIntegerSCEV(0, ISE->getType());
610 SCEVHandle Stride = Start;
611 if (!getSCEVStartAndStride(ISE, L, Start, Stride, SE, DT))
612 return false; // Non-reducible symbolic expression, bail out.
614 std::vector<Instruction *> IUsers;
615 // Collect all I uses now because IVUseShouldUsePostIncValue may
616 // invalidate use_iterator.
617 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
618 IUsers.push_back(cast<Instruction>(*UI));
620 for (unsigned iused_index = 0, iused_size = IUsers.size();
621 iused_index != iused_size; ++iused_index) {
623 Instruction *User = IUsers[iused_index];
625 // Do not infinitely recurse on PHI nodes.
626 if (isa<PHINode>(User) && Processed.count(User))
629 // Descend recursively, but not into PHI nodes outside the current loop.
630 // It's important to see the entire expression outside the loop to get
631 // choices that depend on addressing mode use right, although we won't
632 // consider references ouside the loop in all cases.
633 // If User is already in Processed, we don't want to recurse into it again,
634 // but do want to record a second reference in the same instruction.
635 bool AddUserToIVUsers = false;
636 if (LI->getLoopFor(User->getParent()) != L) {
637 if (isa<PHINode>(User) || Processed.count(User) ||
638 !AddUsersIfInteresting(User, L, Processed)) {
639 DOUT << "FOUND USER in other loop: " << *User
640 << " OF SCEV: " << *ISE << "\n";
641 AddUserToIVUsers = true;
643 } else if (Processed.count(User) ||
644 !AddUsersIfInteresting(User, L, Processed)) {
645 DOUT << "FOUND USER: " << *User
646 << " OF SCEV: " << *ISE << "\n";
647 AddUserToIVUsers = true;
650 if (AddUserToIVUsers) {
651 IVUsersOfOneStride &StrideUses = IVUsesByStride[Stride];
652 if (StrideUses.Users.empty()) // First occurrence of this stride?
653 StrideOrder.push_back(Stride);
655 // Okay, we found a user that we cannot reduce. Analyze the instruction
656 // and decide what to do with it. If we are a use inside of the loop, use
657 // the value before incrementation, otherwise use it after incrementation.
658 if (IVUseShouldUsePostIncValue(User, I, L, DT, this, DeadInsts)) {
659 // The value used will be incremented by the stride more than we are
660 // expecting, so subtract this off.
661 SCEVHandle NewStart = SE->getMinusSCEV(Start, Stride);
662 StrideUses.addUser(NewStart, User, I);
663 StrideUses.Users.back().isUseOfPostIncrementedValue = true;
664 DOUT << " USING POSTINC SCEV, START=" << *NewStart<< "\n";
666 StrideUses.addUser(Start, User, I);
674 /// BasedUser - For a particular base value, keep information about how we've
675 /// partitioned the expression so far.
677 /// SE - The current ScalarEvolution object.
680 /// Base - The Base value for the PHI node that needs to be inserted for
681 /// this use. As the use is processed, information gets moved from this
682 /// field to the Imm field (below). BasedUser values are sorted by this
686 /// Inst - The instruction using the induction variable.
689 /// OperandValToReplace - The operand value of Inst to replace with the
691 Value *OperandValToReplace;
693 /// Imm - The immediate value that should be added to the base immediately
694 /// before Inst, because it will be folded into the imm field of the
695 /// instruction. This is also sometimes used for loop-variant values that
696 /// must be added inside the loop.
699 /// Phi - The induction variable that performs the striding that
700 /// should be used for this user.
703 // isUseOfPostIncrementedValue - True if this should use the
704 // post-incremented version of this IV, not the preincremented version.
705 // This can only be set in special cases, such as the terminating setcc
706 // instruction for a loop and uses outside the loop that are dominated by
708 bool isUseOfPostIncrementedValue;
710 BasedUser(IVStrideUse &IVSU, ScalarEvolution *se)
711 : SE(se), Base(IVSU.Offset), Inst(IVSU.User),
712 OperandValToReplace(IVSU.OperandValToReplace),
713 Imm(SE->getIntegerSCEV(0, Base->getType())),
714 isUseOfPostIncrementedValue(IVSU.isUseOfPostIncrementedValue) {}
716 // Once we rewrite the code to insert the new IVs we want, update the
717 // operands of Inst to use the new expression 'NewBase', with 'Imm' added
719 void RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
720 Instruction *InsertPt,
721 SCEVExpander &Rewriter, Loop *L, Pass *P,
722 SmallVectorImpl<Instruction*> &DeadInsts);
724 Value *InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
725 SCEVExpander &Rewriter,
726 Instruction *IP, Loop *L);
731 void BasedUser::dump() const {
732 cerr << " Base=" << *Base;
733 cerr << " Imm=" << *Imm;
734 cerr << " Inst: " << *Inst;
737 Value *BasedUser::InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
738 SCEVExpander &Rewriter,
739 Instruction *IP, Loop *L) {
740 // Figure out where we *really* want to insert this code. In particular, if
741 // the user is inside of a loop that is nested inside of L, we really don't
742 // want to insert this expression before the user, we'd rather pull it out as
743 // many loops as possible.
744 LoopInfo &LI = Rewriter.getLoopInfo();
745 Instruction *BaseInsertPt = IP;
747 // Figure out the most-nested loop that IP is in.
748 Loop *InsertLoop = LI.getLoopFor(IP->getParent());
750 // If InsertLoop is not L, and InsertLoop is nested inside of L, figure out
751 // the preheader of the outer-most loop where NewBase is not loop invariant.
752 if (L->contains(IP->getParent()))
753 while (InsertLoop && NewBase->isLoopInvariant(InsertLoop)) {
754 BaseInsertPt = InsertLoop->getLoopPreheader()->getTerminator();
755 InsertLoop = InsertLoop->getParentLoop();
758 Value *Base = Rewriter.expandCodeFor(NewBase, BaseInsertPt);
760 // If there is no immediate value, skip the next part.
764 // If we are inserting the base and imm values in the same block, make sure to
765 // adjust the IP position if insertion reused a result.
766 if (IP == BaseInsertPt)
767 IP = Rewriter.getInsertionPoint();
769 // Always emit the immediate (if non-zero) into the same block as the user.
770 SCEVHandle NewValSCEV = SE->getAddExpr(SE->getUnknown(Base), Imm);
771 return Rewriter.expandCodeFor(NewValSCEV, IP);
776 // Once we rewrite the code to insert the new IVs we want, update the
777 // operands of Inst to use the new expression 'NewBase', with 'Imm' added
778 // to it. NewBasePt is the last instruction which contributes to the
779 // value of NewBase in the case that it's a diffferent instruction from
780 // the PHI that NewBase is computed from, or null otherwise.
782 void BasedUser::RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
783 Instruction *NewBasePt,
784 SCEVExpander &Rewriter, Loop *L, Pass *P,
785 SmallVectorImpl<Instruction*> &DeadInsts){
786 if (!isa<PHINode>(Inst)) {
787 // By default, insert code at the user instruction.
788 BasicBlock::iterator InsertPt = Inst;
790 // However, if the Operand is itself an instruction, the (potentially
791 // complex) inserted code may be shared by many users. Because of this, we
792 // want to emit code for the computation of the operand right before its old
793 // computation. This is usually safe, because we obviously used to use the
794 // computation when it was computed in its current block. However, in some
795 // cases (e.g. use of a post-incremented induction variable) the NewBase
796 // value will be pinned to live somewhere after the original computation.
797 // In this case, we have to back off.
799 // If this is a use outside the loop (which means after, since it is based
800 // on a loop indvar) we use the post-incremented value, so that we don't
801 // artificially make the preinc value live out the bottom of the loop.
802 if (!isUseOfPostIncrementedValue && L->contains(Inst->getParent())) {
803 if (NewBasePt && isa<PHINode>(OperandValToReplace)) {
804 InsertPt = NewBasePt;
806 } else if (Instruction *OpInst
807 = dyn_cast<Instruction>(OperandValToReplace)) {
809 while (isa<PHINode>(InsertPt)) ++InsertPt;
812 Value *NewVal = InsertCodeForBaseAtPosition(NewBase, Rewriter, InsertPt, L);
813 // Adjust the type back to match the Inst. Note that we can't use InsertPt
814 // here because the SCEVExpander may have inserted the instructions after
815 // that point, in its efforts to avoid inserting redundant expressions.
816 if (isa<PointerType>(OperandValToReplace->getType())) {
817 NewVal = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr,
819 OperandValToReplace->getType());
821 // Replace the use of the operand Value with the new Phi we just created.
822 Inst->replaceUsesOfWith(OperandValToReplace, NewVal);
824 DOUT << " Replacing with ";
825 DEBUG(WriteAsOperand(*DOUT, NewVal, /*PrintType=*/false));
826 DOUT << ", which has value " << *NewBase << " plus IMM " << *Imm << "\n";
830 // PHI nodes are more complex. We have to insert one copy of the NewBase+Imm
831 // expression into each operand block that uses it. Note that PHI nodes can
832 // have multiple entries for the same predecessor. We use a map to make sure
833 // that a PHI node only has a single Value* for each predecessor (which also
834 // prevents us from inserting duplicate code in some blocks).
835 DenseMap<BasicBlock*, Value*> InsertedCode;
836 PHINode *PN = cast<PHINode>(Inst);
837 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
838 if (PN->getIncomingValue(i) == OperandValToReplace) {
839 // If the original expression is outside the loop, put the replacement
840 // code in the same place as the original expression,
841 // which need not be an immediate predecessor of this PHI. This way we
842 // need only one copy of it even if it is referenced multiple times in
843 // the PHI. We don't do this when the original expression is inside the
844 // loop because multiple copies sometimes do useful sinking of code in
846 Instruction *OldLoc = dyn_cast<Instruction>(OperandValToReplace);
847 if (L->contains(OldLoc->getParent())) {
848 // If this is a critical edge, split the edge so that we do not insert
849 // the code on all predecessor/successor paths. We do this unless this
850 // is the canonical backedge for this loop, as this can make some
851 // inserted code be in an illegal position.
852 BasicBlock *PHIPred = PN->getIncomingBlock(i);
853 if (e != 1 && PHIPred->getTerminator()->getNumSuccessors() > 1 &&
854 (PN->getParent() != L->getHeader() || !L->contains(PHIPred))) {
856 // First step, split the critical edge.
857 SplitCriticalEdge(PHIPred, PN->getParent(), P, false);
859 // Next step: move the basic block. In particular, if the PHI node
860 // is outside of the loop, and PredTI is in the loop, we want to
861 // move the block to be immediately before the PHI block, not
862 // immediately after PredTI.
863 if (L->contains(PHIPred) && !L->contains(PN->getParent())) {
864 BasicBlock *NewBB = PN->getIncomingBlock(i);
865 NewBB->moveBefore(PN->getParent());
868 // Splitting the edge can reduce the number of PHI entries we have.
869 e = PN->getNumIncomingValues();
872 Value *&Code = InsertedCode[PN->getIncomingBlock(i)];
874 // Insert the code into the end of the predecessor block.
875 Instruction *InsertPt = (L->contains(OldLoc->getParent())) ?
876 PN->getIncomingBlock(i)->getTerminator() :
877 OldLoc->getParent()->getTerminator();
878 Code = InsertCodeForBaseAtPosition(NewBase, Rewriter, InsertPt, L);
880 // Adjust the type back to match the PHI. Note that we can't use
881 // InsertPt here because the SCEVExpander may have inserted its
882 // instructions after that point, in its efforts to avoid inserting
883 // redundant expressions.
884 if (isa<PointerType>(PN->getType())) {
885 Code = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr,
890 DOUT << " Changing PHI use to ";
891 DEBUG(WriteAsOperand(*DOUT, Code, /*PrintType=*/false));
892 DOUT << ", which has value " << *NewBase << " plus IMM " << *Imm << "\n";
895 // Replace the use of the operand Value with the new Phi we just created.
896 PN->setIncomingValue(i, Code);
901 // PHI node might have become a constant value after SplitCriticalEdge.
902 DeadInsts.push_back(Inst);
906 /// fitsInAddressMode - Return true if V can be subsumed within an addressing
907 /// mode, and does not need to be put in a register first.
908 static bool fitsInAddressMode(const SCEVHandle &V, const Type *UseTy,
909 const TargetLowering *TLI, bool HasBaseReg) {
910 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(V)) {
911 int64_t VC = SC->getValue()->getSExtValue();
913 TargetLowering::AddrMode AM;
915 AM.HasBaseReg = HasBaseReg;
916 return TLI->isLegalAddressingMode(AM, UseTy);
918 // Defaults to PPC. PPC allows a sign-extended 16-bit immediate field.
919 return (VC > -(1 << 16) && VC < (1 << 16)-1);
923 if (SCEVUnknown *SU = dyn_cast<SCEVUnknown>(V))
924 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(SU->getValue()))
925 if (TLI && CE->getOpcode() == Instruction::PtrToInt) {
926 Constant *Op0 = CE->getOperand(0);
927 if (GlobalValue *GV = dyn_cast<GlobalValue>(Op0)) {
928 TargetLowering::AddrMode AM;
930 AM.HasBaseReg = HasBaseReg;
931 return TLI->isLegalAddressingMode(AM, UseTy);
937 /// MoveLoopVariantsToImmediateField - Move any subexpressions from Val that are
938 /// loop varying to the Imm operand.
939 static void MoveLoopVariantsToImmediateField(SCEVHandle &Val, SCEVHandle &Imm,
940 Loop *L, ScalarEvolution *SE) {
941 if (Val->isLoopInvariant(L)) return; // Nothing to do.
943 if (SCEVAddExpr *SAE = dyn_cast<SCEVAddExpr>(Val)) {
944 std::vector<SCEVHandle> NewOps;
945 NewOps.reserve(SAE->getNumOperands());
947 for (unsigned i = 0; i != SAE->getNumOperands(); ++i)
948 if (!SAE->getOperand(i)->isLoopInvariant(L)) {
949 // If this is a loop-variant expression, it must stay in the immediate
950 // field of the expression.
951 Imm = SE->getAddExpr(Imm, SAE->getOperand(i));
953 NewOps.push_back(SAE->getOperand(i));
957 Val = SE->getIntegerSCEV(0, Val->getType());
959 Val = SE->getAddExpr(NewOps);
960 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Val)) {
961 // Try to pull immediates out of the start value of nested addrec's.
962 SCEVHandle Start = SARE->getStart();
963 MoveLoopVariantsToImmediateField(Start, Imm, L, SE);
965 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
967 Val = SE->getAddRecExpr(Ops, SARE->getLoop());
969 // Otherwise, all of Val is variant, move the whole thing over.
970 Imm = SE->getAddExpr(Imm, Val);
971 Val = SE->getIntegerSCEV(0, Val->getType());
976 /// MoveImmediateValues - Look at Val, and pull out any additions of constants
977 /// that can fit into the immediate field of instructions in the target.
978 /// Accumulate these immediate values into the Imm value.
979 static void MoveImmediateValues(const TargetLowering *TLI,
981 SCEVHandle &Val, SCEVHandle &Imm,
982 bool isAddress, Loop *L,
983 ScalarEvolution *SE) {
984 if (SCEVAddExpr *SAE = dyn_cast<SCEVAddExpr>(Val)) {
985 std::vector<SCEVHandle> NewOps;
986 NewOps.reserve(SAE->getNumOperands());
988 for (unsigned i = 0; i != SAE->getNumOperands(); ++i) {
989 SCEVHandle NewOp = SAE->getOperand(i);
990 MoveImmediateValues(TLI, UseTy, NewOp, Imm, isAddress, L, SE);
992 if (!NewOp->isLoopInvariant(L)) {
993 // If this is a loop-variant expression, it must stay in the immediate
994 // field of the expression.
995 Imm = SE->getAddExpr(Imm, NewOp);
997 NewOps.push_back(NewOp);
1002 Val = SE->getIntegerSCEV(0, Val->getType());
1004 Val = SE->getAddExpr(NewOps);
1006 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Val)) {
1007 // Try to pull immediates out of the start value of nested addrec's.
1008 SCEVHandle Start = SARE->getStart();
1009 MoveImmediateValues(TLI, UseTy, Start, Imm, isAddress, L, SE);
1011 if (Start != SARE->getStart()) {
1012 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
1014 Val = SE->getAddRecExpr(Ops, SARE->getLoop());
1017 } else if (SCEVMulExpr *SME = dyn_cast<SCEVMulExpr>(Val)) {
1018 // Transform "8 * (4 + v)" -> "32 + 8*V" if "32" fits in the immed field.
1019 if (isAddress && fitsInAddressMode(SME->getOperand(0), UseTy, TLI, false) &&
1020 SME->getNumOperands() == 2 && SME->isLoopInvariant(L)) {
1022 SCEVHandle SubImm = SE->getIntegerSCEV(0, Val->getType());
1023 SCEVHandle NewOp = SME->getOperand(1);
1024 MoveImmediateValues(TLI, UseTy, NewOp, SubImm, isAddress, L, SE);
1026 // If we extracted something out of the subexpressions, see if we can
1028 if (NewOp != SME->getOperand(1)) {
1029 // Scale SubImm up by "8". If the result is a target constant, we are
1031 SubImm = SE->getMulExpr(SubImm, SME->getOperand(0));
1032 if (fitsInAddressMode(SubImm, UseTy, TLI, false)) {
1033 // Accumulate the immediate.
1034 Imm = SE->getAddExpr(Imm, SubImm);
1036 // Update what is left of 'Val'.
1037 Val = SE->getMulExpr(SME->getOperand(0), NewOp);
1044 // Loop-variant expressions must stay in the immediate field of the
1046 if ((isAddress && fitsInAddressMode(Val, UseTy, TLI, false)) ||
1047 !Val->isLoopInvariant(L)) {
1048 Imm = SE->getAddExpr(Imm, Val);
1049 Val = SE->getIntegerSCEV(0, Val->getType());
1053 // Otherwise, no immediates to move.
1056 static void MoveImmediateValues(const TargetLowering *TLI,
1058 SCEVHandle &Val, SCEVHandle &Imm,
1059 bool isAddress, Loop *L,
1060 ScalarEvolution *SE) {
1061 const Type *UseTy = getAccessType(User);
1062 MoveImmediateValues(TLI, UseTy, Val, Imm, isAddress, L, SE);
1065 /// SeparateSubExprs - Decompose Expr into all of the subexpressions that are
1066 /// added together. This is used to reassociate common addition subexprs
1067 /// together for maximal sharing when rewriting bases.
1068 static void SeparateSubExprs(std::vector<SCEVHandle> &SubExprs,
1070 ScalarEvolution *SE) {
1071 if (SCEVAddExpr *AE = dyn_cast<SCEVAddExpr>(Expr)) {
1072 for (unsigned j = 0, e = AE->getNumOperands(); j != e; ++j)
1073 SeparateSubExprs(SubExprs, AE->getOperand(j), SE);
1074 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Expr)) {
1075 SCEVHandle Zero = SE->getIntegerSCEV(0, Expr->getType());
1076 if (SARE->getOperand(0) == Zero) {
1077 SubExprs.push_back(Expr);
1079 // Compute the addrec with zero as its base.
1080 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
1081 Ops[0] = Zero; // Start with zero base.
1082 SubExprs.push_back(SE->getAddRecExpr(Ops, SARE->getLoop()));
1085 SeparateSubExprs(SubExprs, SARE->getOperand(0), SE);
1087 } else if (!Expr->isZero()) {
1089 SubExprs.push_back(Expr);
1093 // This is logically local to the following function, but C++ says we have
1094 // to make it file scope.
1095 struct SubExprUseData { unsigned Count; bool notAllUsesAreFree; };
1097 /// RemoveCommonExpressionsFromUseBases - Look through all of the Bases of all
1098 /// the Uses, removing any common subexpressions, except that if all such
1099 /// subexpressions can be folded into an addressing mode for all uses inside
1100 /// the loop (this case is referred to as "free" in comments herein) we do
1101 /// not remove anything. This looks for things like (a+b+c) and
1102 /// (a+c+d) and computes the common (a+c) subexpression. The common expression
1103 /// is *removed* from the Bases and returned.
1105 RemoveCommonExpressionsFromUseBases(std::vector<BasedUser> &Uses,
1106 ScalarEvolution *SE, Loop *L,
1107 const TargetLowering *TLI) {
1108 unsigned NumUses = Uses.size();
1110 // Only one use? This is a very common case, so we handle it specially and
1112 SCEVHandle Zero = SE->getIntegerSCEV(0, Uses[0].Base->getType());
1113 SCEVHandle Result = Zero;
1114 SCEVHandle FreeResult = Zero;
1116 // If the use is inside the loop, use its base, regardless of what it is:
1117 // it is clearly shared across all the IV's. If the use is outside the loop
1118 // (which means after it) we don't want to factor anything *into* the loop,
1119 // so just use 0 as the base.
1120 if (L->contains(Uses[0].Inst->getParent()))
1121 std::swap(Result, Uses[0].Base);
1125 // To find common subexpressions, count how many of Uses use each expression.
1126 // If any subexpressions are used Uses.size() times, they are common.
1127 // Also track whether all uses of each expression can be moved into an
1128 // an addressing mode "for free"; such expressions are left within the loop.
1129 // struct SubExprUseData { unsigned Count; bool notAllUsesAreFree; };
1130 std::map<SCEVHandle, SubExprUseData> SubExpressionUseData;
1132 // UniqueSubExprs - Keep track of all of the subexpressions we see in the
1133 // order we see them.
1134 std::vector<SCEVHandle> UniqueSubExprs;
1136 std::vector<SCEVHandle> SubExprs;
1137 unsigned NumUsesInsideLoop = 0;
1138 for (unsigned i = 0; i != NumUses; ++i) {
1139 // If the user is outside the loop, just ignore it for base computation.
1140 // Since the user is outside the loop, it must be *after* the loop (if it
1141 // were before, it could not be based on the loop IV). We don't want users
1142 // after the loop to affect base computation of values *inside* the loop,
1143 // because we can always add their offsets to the result IV after the loop
1144 // is done, ensuring we get good code inside the loop.
1145 if (!L->contains(Uses[i].Inst->getParent()))
1147 NumUsesInsideLoop++;
1149 // If the base is zero (which is common), return zero now, there are no
1150 // CSEs we can find.
1151 if (Uses[i].Base == Zero) return Zero;
1153 // If this use is as an address we may be able to put CSEs in the addressing
1154 // mode rather than hoisting them.
1155 bool isAddrUse = isAddressUse(Uses[i].Inst, Uses[i].OperandValToReplace);
1156 // We may need the UseTy below, but only when isAddrUse, so compute it
1157 // only in that case.
1158 const Type *UseTy = 0;
1160 UseTy = getAccessType(Uses[i].Inst);
1162 // Split the expression into subexprs.
1163 SeparateSubExprs(SubExprs, Uses[i].Base, SE);
1164 // Add one to SubExpressionUseData.Count for each subexpr present, and
1165 // if the subexpr is not a valid immediate within an addressing mode use,
1166 // set SubExpressionUseData.notAllUsesAreFree. We definitely want to
1167 // hoist these out of the loop (if they are common to all uses).
1168 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j) {
1169 if (++SubExpressionUseData[SubExprs[j]].Count == 1)
1170 UniqueSubExprs.push_back(SubExprs[j]);
1171 if (!isAddrUse || !fitsInAddressMode(SubExprs[j], UseTy, TLI, false))
1172 SubExpressionUseData[SubExprs[j]].notAllUsesAreFree = true;
1177 // Now that we know how many times each is used, build Result. Iterate over
1178 // UniqueSubexprs so that we have a stable ordering.
1179 for (unsigned i = 0, e = UniqueSubExprs.size(); i != e; ++i) {
1180 std::map<SCEVHandle, SubExprUseData>::iterator I =
1181 SubExpressionUseData.find(UniqueSubExprs[i]);
1182 assert(I != SubExpressionUseData.end() && "Entry not found?");
1183 if (I->second.Count == NumUsesInsideLoop) { // Found CSE!
1184 if (I->second.notAllUsesAreFree)
1185 Result = SE->getAddExpr(Result, I->first);
1187 FreeResult = SE->getAddExpr(FreeResult, I->first);
1189 // Remove non-cse's from SubExpressionUseData.
1190 SubExpressionUseData.erase(I);
1193 if (FreeResult != Zero) {
1194 // We have some subexpressions that can be subsumed into addressing
1195 // modes in every use inside the loop. However, it's possible that
1196 // there are so many of them that the combined FreeResult cannot
1197 // be subsumed, or that the target cannot handle both a FreeResult
1198 // and a Result in the same instruction (for example because it would
1199 // require too many registers). Check this.
1200 for (unsigned i=0; i<NumUses; ++i) {
1201 if (!L->contains(Uses[i].Inst->getParent()))
1203 // We know this is an addressing mode use; if there are any uses that
1204 // are not, FreeResult would be Zero.
1205 const Type *UseTy = getAccessType(Uses[i].Inst);
1206 if (!fitsInAddressMode(FreeResult, UseTy, TLI, Result!=Zero)) {
1207 // FIXME: could split up FreeResult into pieces here, some hoisted
1208 // and some not. There is no obvious advantage to this.
1209 Result = SE->getAddExpr(Result, FreeResult);
1216 // If we found no CSE's, return now.
1217 if (Result == Zero) return Result;
1219 // If we still have a FreeResult, remove its subexpressions from
1220 // SubExpressionUseData. This means they will remain in the use Bases.
1221 if (FreeResult != Zero) {
1222 SeparateSubExprs(SubExprs, FreeResult, SE);
1223 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j) {
1224 std::map<SCEVHandle, SubExprUseData>::iterator I =
1225 SubExpressionUseData.find(SubExprs[j]);
1226 SubExpressionUseData.erase(I);
1231 // Otherwise, remove all of the CSE's we found from each of the base values.
1232 for (unsigned i = 0; i != NumUses; ++i) {
1233 // Uses outside the loop don't necessarily include the common base, but
1234 // the final IV value coming into those uses does. Instead of trying to
1235 // remove the pieces of the common base, which might not be there,
1236 // subtract off the base to compensate for this.
1237 if (!L->contains(Uses[i].Inst->getParent())) {
1238 Uses[i].Base = SE->getMinusSCEV(Uses[i].Base, Result);
1242 // Split the expression into subexprs.
1243 SeparateSubExprs(SubExprs, Uses[i].Base, SE);
1245 // Remove any common subexpressions.
1246 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j)
1247 if (SubExpressionUseData.count(SubExprs[j])) {
1248 SubExprs.erase(SubExprs.begin()+j);
1252 // Finally, add the non-shared expressions together.
1253 if (SubExprs.empty())
1254 Uses[i].Base = Zero;
1256 Uses[i].Base = SE->getAddExpr(SubExprs);
1263 /// ValidStride - Check whether the given Scale is valid for all loads and
1264 /// stores in UsersToProcess.
1266 bool LoopStrengthReduce::ValidStride(bool HasBaseReg,
1268 const std::vector<BasedUser>& UsersToProcess) {
1272 for (unsigned i=0, e = UsersToProcess.size(); i!=e; ++i) {
1273 // If this is a load or other access, pass the type of the access in.
1274 const Type *AccessTy = Type::VoidTy;
1275 if (isAddressUse(UsersToProcess[i].Inst,
1276 UsersToProcess[i].OperandValToReplace))
1277 AccessTy = getAccessType(UsersToProcess[i].Inst);
1278 else if (isa<PHINode>(UsersToProcess[i].Inst))
1281 TargetLowering::AddrMode AM;
1282 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(UsersToProcess[i].Imm))
1283 AM.BaseOffs = SC->getValue()->getSExtValue();
1284 AM.HasBaseReg = HasBaseReg || !UsersToProcess[i].Base->isZero();
1287 // If load[imm+r*scale] is illegal, bail out.
1288 if (!TLI->isLegalAddressingMode(AM, AccessTy))
1294 /// RequiresTypeConversion - Returns true if converting Ty1 to Ty2 is not
1296 bool LoopStrengthReduce::RequiresTypeConversion(const Type *Ty1,
1300 if (Ty1->canLosslesslyBitCastTo(Ty2))
1302 if (TLI && TLI->isTruncateFree(Ty1, Ty2))
1304 if (isa<PointerType>(Ty2) && Ty1->canLosslesslyBitCastTo(UIntPtrTy))
1306 if (isa<PointerType>(Ty1) && Ty2->canLosslesslyBitCastTo(UIntPtrTy))
1311 /// CheckForIVReuse - Returns the multiple if the stride is the multiple
1312 /// of a previous stride and it is a legal value for the target addressing
1313 /// mode scale component and optional base reg. This allows the users of
1314 /// this stride to be rewritten as prev iv * factor. It returns 0 if no
1315 /// reuse is possible. Factors can be negative on same targets, e.g. ARM.
1317 /// If all uses are outside the loop, we don't require that all multiplies
1318 /// be folded into the addressing mode, nor even that the factor be constant;
1319 /// a multiply (executed once) outside the loop is better than another IV
1320 /// within. Well, usually.
1321 SCEVHandle LoopStrengthReduce::CheckForIVReuse(bool HasBaseReg,
1322 bool AllUsesAreAddresses,
1323 bool AllUsesAreOutsideLoop,
1324 const SCEVHandle &Stride,
1325 IVExpr &IV, const Type *Ty,
1326 const std::vector<BasedUser>& UsersToProcess) {
1327 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Stride)) {
1328 int64_t SInt = SC->getValue()->getSExtValue();
1329 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1331 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1332 IVsByStride.find(StrideOrder[NewStride]);
1333 if (SI == IVsByStride.end() || !isa<SCEVConstant>(SI->first))
1335 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
1336 if (SI->first != Stride &&
1337 (unsigned(abs(SInt)) < SSInt || (SInt % SSInt) != 0))
1339 int64_t Scale = SInt / SSInt;
1340 // Check that this stride is valid for all the types used for loads and
1341 // stores; if it can be used for some and not others, we might as well use
1342 // the original stride everywhere, since we have to create the IV for it
1343 // anyway. If the scale is 1, then we don't need to worry about folding
1346 (AllUsesAreAddresses &&
1347 ValidStride(HasBaseReg, Scale, UsersToProcess)))
1348 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1349 IE = SI->second.IVs.end(); II != IE; ++II)
1350 // FIXME: Only handle base == 0 for now.
1351 // Only reuse previous IV if it would not require a type conversion.
1352 if (II->Base->isZero() &&
1353 !RequiresTypeConversion(II->Base->getType(), Ty)) {
1355 return SE->getIntegerSCEV(Scale, Stride->getType());
1358 } else if (AllUsesAreOutsideLoop) {
1359 // Accept nonconstant strides here; it is really really right to substitute
1360 // an existing IV if we can.
1361 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1363 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1364 IVsByStride.find(StrideOrder[NewStride]);
1365 if (SI == IVsByStride.end() || !isa<SCEVConstant>(SI->first))
1367 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
1368 if (SI->first != Stride && SSInt != 1)
1370 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1371 IE = SI->second.IVs.end(); II != IE; ++II)
1372 // Accept nonzero base here.
1373 // Only reuse previous IV if it would not require a type conversion.
1374 if (!RequiresTypeConversion(II->Base->getType(), Ty)) {
1379 // Special case, old IV is -1*x and this one is x. Can treat this one as
1381 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1383 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1384 IVsByStride.find(StrideOrder[NewStride]);
1385 if (SI == IVsByStride.end())
1387 if (SCEVMulExpr *ME = dyn_cast<SCEVMulExpr>(SI->first))
1388 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(ME->getOperand(0)))
1389 if (Stride == ME->getOperand(1) &&
1390 SC->getValue()->getSExtValue() == -1LL)
1391 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1392 IE = SI->second.IVs.end(); II != IE; ++II)
1393 // Accept nonzero base here.
1394 // Only reuse previous IV if it would not require type conversion.
1395 if (!RequiresTypeConversion(II->Base->getType(), Ty)) {
1397 return SE->getIntegerSCEV(-1LL, Stride->getType());
1401 return SE->getIntegerSCEV(0, Stride->getType());
1404 /// PartitionByIsUseOfPostIncrementedValue - Simple boolean predicate that
1405 /// returns true if Val's isUseOfPostIncrementedValue is true.
1406 static bool PartitionByIsUseOfPostIncrementedValue(const BasedUser &Val) {
1407 return Val.isUseOfPostIncrementedValue;
1410 /// isNonConstantNegative - Return true if the specified scev is negated, but
1412 static bool isNonConstantNegative(const SCEVHandle &Expr) {
1413 SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(Expr);
1414 if (!Mul) return false;
1416 // If there is a constant factor, it will be first.
1417 SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0));
1418 if (!SC) return false;
1420 // Return true if the value is negative, this matches things like (-42 * V).
1421 return SC->getValue()->getValue().isNegative();
1424 // CollectIVUsers - Transform our list of users and offsets to a bit more
1425 // complex table. In this new vector, each 'BasedUser' contains 'Base', the base
1426 // of the strided accesses, as well as the old information from Uses. We
1427 // progressively move information from the Base field to the Imm field, until
1428 // we eventually have the full access expression to rewrite the use.
1429 SCEVHandle LoopStrengthReduce::CollectIVUsers(const SCEVHandle &Stride,
1430 IVUsersOfOneStride &Uses,
1432 bool &AllUsesAreAddresses,
1433 bool &AllUsesAreOutsideLoop,
1434 std::vector<BasedUser> &UsersToProcess) {
1435 UsersToProcess.reserve(Uses.Users.size());
1436 for (unsigned i = 0, e = Uses.Users.size(); i != e; ++i) {
1437 UsersToProcess.push_back(BasedUser(Uses.Users[i], SE));
1439 // Move any loop variant operands from the offset field to the immediate
1440 // field of the use, so that we don't try to use something before it is
1442 MoveLoopVariantsToImmediateField(UsersToProcess.back().Base,
1443 UsersToProcess.back().Imm, L, SE);
1444 assert(UsersToProcess.back().Base->isLoopInvariant(L) &&
1445 "Base value is not loop invariant!");
1448 // We now have a whole bunch of uses of like-strided induction variables, but
1449 // they might all have different bases. We want to emit one PHI node for this
1450 // stride which we fold as many common expressions (between the IVs) into as
1451 // possible. Start by identifying the common expressions in the base values
1452 // for the strides (e.g. if we have "A+C+B" and "A+B+D" as our bases, find
1453 // "A+B"), emit it to the preheader, then remove the expression from the
1454 // UsersToProcess base values.
1455 SCEVHandle CommonExprs =
1456 RemoveCommonExpressionsFromUseBases(UsersToProcess, SE, L, TLI);
1458 // Next, figure out what we can represent in the immediate fields of
1459 // instructions. If we can represent anything there, move it to the imm
1460 // fields of the BasedUsers. We do this so that it increases the commonality
1461 // of the remaining uses.
1462 unsigned NumPHI = 0;
1463 bool HasAddress = false;
1464 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1465 // If the user is not in the current loop, this means it is using the exit
1466 // value of the IV. Do not put anything in the base, make sure it's all in
1467 // the immediate field to allow as much factoring as possible.
1468 if (!L->contains(UsersToProcess[i].Inst->getParent())) {
1469 UsersToProcess[i].Imm = SE->getAddExpr(UsersToProcess[i].Imm,
1470 UsersToProcess[i].Base);
1471 UsersToProcess[i].Base =
1472 SE->getIntegerSCEV(0, UsersToProcess[i].Base->getType());
1474 // Not all uses are outside the loop.
1475 AllUsesAreOutsideLoop = false;
1477 // Addressing modes can be folded into loads and stores. Be careful that
1478 // the store is through the expression, not of the expression though.
1480 bool isAddress = isAddressUse(UsersToProcess[i].Inst,
1481 UsersToProcess[i].OperandValToReplace);
1482 if (isa<PHINode>(UsersToProcess[i].Inst)) {
1490 // If this use isn't an address, then not all uses are addresses.
1491 if (!isAddress && !isPHI)
1492 AllUsesAreAddresses = false;
1494 MoveImmediateValues(TLI, UsersToProcess[i].Inst, UsersToProcess[i].Base,
1495 UsersToProcess[i].Imm, isAddress, L, SE);
1499 // If one of the use is a PHI node and all other uses are addresses, still
1500 // allow iv reuse. Essentially we are trading one constant multiplication
1501 // for one fewer iv.
1503 AllUsesAreAddresses = false;
1505 // There are no in-loop address uses.
1506 if (AllUsesAreAddresses && (!HasAddress && !AllUsesAreOutsideLoop))
1507 AllUsesAreAddresses = false;
1512 /// ShouldUseFullStrengthReductionMode - Test whether full strength-reduction
1513 /// is valid and profitable for the given set of users of a stride. In
1514 /// full strength-reduction mode, all addresses at the current stride are
1515 /// strength-reduced all the way down to pointer arithmetic.
1517 bool LoopStrengthReduce::ShouldUseFullStrengthReductionMode(
1518 const std::vector<BasedUser> &UsersToProcess,
1520 bool AllUsesAreAddresses,
1521 SCEVHandle Stride) {
1522 if (!EnableFullLSRMode)
1525 // The heuristics below aim to avoid increasing register pressure, but
1526 // fully strength-reducing all the addresses increases the number of
1527 // add instructions, so don't do this when optimizing for size.
1528 // TODO: If the loop is large, the savings due to simpler addresses
1529 // may oughtweight the costs of the extra increment instructions.
1530 if (L->getHeader()->getParent()->hasFnAttr(Attribute::OptimizeForSize))
1533 // TODO: For now, don't do full strength reduction if there could
1534 // potentially be greater-stride multiples of the current stride
1535 // which could reuse the current stride IV.
1536 if (StrideOrder.back() != Stride)
1539 // Iterate through the uses to find conditions that automatically rule out
1541 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ) {
1542 SCEV *Base = UsersToProcess[i].Base;
1543 SCEV *Imm = UsersToProcess[i].Imm;
1544 // If any users have a loop-variant component, they can't be fully
1545 // strength-reduced.
1546 if (Imm && !Imm->isLoopInvariant(L))
1548 // If there are to users with the same base and the difference between
1549 // the two Imm values can't be folded into the address, full
1550 // strength reduction would increase register pressure.
1552 SCEV *CurImm = UsersToProcess[i].Imm;
1553 if ((CurImm || Imm) && CurImm != Imm) {
1554 if (!CurImm) CurImm = SE->getIntegerSCEV(0, Stride->getType());
1555 if (!Imm) Imm = SE->getIntegerSCEV(0, Stride->getType());
1556 const Instruction *Inst = UsersToProcess[i].Inst;
1557 const Type *UseTy = getAccessType(Inst);
1558 SCEVHandle Diff = SE->getMinusSCEV(UsersToProcess[i].Imm, Imm);
1559 if (!Diff->isZero() &&
1560 (!AllUsesAreAddresses ||
1561 !fitsInAddressMode(Diff, UseTy, TLI, /*HasBaseReg=*/true)))
1564 } while (++i != e && Base == UsersToProcess[i].Base);
1567 // If there's exactly one user in this stride, fully strength-reducing it
1568 // won't increase register pressure. If it's starting from a non-zero base,
1569 // it'll be simpler this way.
1570 if (UsersToProcess.size() == 1 && !UsersToProcess[0].Base->isZero())
1573 // Otherwise, if there are any users in this stride that don't require
1574 // a register for their base, full strength-reduction will increase
1575 // register pressure.
1576 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1577 if (UsersToProcess[i].Base->isZero())
1580 // Otherwise, go for it.
1584 /// InsertAffinePhi Create and insert a PHI node for an induction variable
1585 /// with the specified start and step values in the specified loop.
1587 /// If NegateStride is true, the stride should be negated by using a
1588 /// subtract instead of an add.
1590 /// Return the created phi node.
1592 static PHINode *InsertAffinePhi(SCEVHandle Start, SCEVHandle Step,
1594 SCEVExpander &Rewriter) {
1595 assert(Start->isLoopInvariant(L) && "New PHI start is not loop invariant!");
1596 assert(Step->isLoopInvariant(L) && "New PHI stride is not loop invariant!");
1598 BasicBlock *Header = L->getHeader();
1599 BasicBlock *Preheader = L->getLoopPreheader();
1600 BasicBlock *LatchBlock = L->getLoopLatch();
1602 PHINode *PN = PHINode::Create(Start->getType(), "lsr.iv", Header->begin());
1603 PN->addIncoming(Rewriter.expandCodeFor(Start, Preheader->getTerminator()),
1606 // If the stride is negative, insert a sub instead of an add for the
1608 bool isNegative = isNonConstantNegative(Step);
1609 SCEVHandle IncAmount = Step;
1611 IncAmount = Rewriter.SE.getNegativeSCEV(Step);
1613 // Insert an add instruction right before the terminator corresponding
1614 // to the back-edge.
1615 Value *StepV = Rewriter.expandCodeFor(IncAmount, Preheader->getTerminator());
1618 IncV = BinaryOperator::CreateSub(PN, StepV, "lsr.iv.next",
1619 LatchBlock->getTerminator());
1621 IncV = BinaryOperator::CreateAdd(PN, StepV, "lsr.iv.next",
1622 LatchBlock->getTerminator());
1624 if (!isa<ConstantInt>(StepV)) ++NumVariable;
1626 PN->addIncoming(IncV, LatchBlock);
1632 static void SortUsersToProcess(std::vector<BasedUser> &UsersToProcess) {
1633 // We want to emit code for users inside the loop first. To do this, we
1634 // rearrange BasedUser so that the entries at the end have
1635 // isUseOfPostIncrementedValue = false, because we pop off the end of the
1636 // vector (so we handle them first).
1637 std::partition(UsersToProcess.begin(), UsersToProcess.end(),
1638 PartitionByIsUseOfPostIncrementedValue);
1640 // Sort this by base, so that things with the same base are handled
1641 // together. By partitioning first and stable-sorting later, we are
1642 // guaranteed that within each base we will pop off users from within the
1643 // loop before users outside of the loop with a particular base.
1645 // We would like to use stable_sort here, but we can't. The problem is that
1646 // SCEVHandle's don't have a deterministic ordering w.r.t to each other, so
1647 // we don't have anything to do a '<' comparison on. Because we think the
1648 // number of uses is small, do a horrible bubble sort which just relies on
1650 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1651 // Get a base value.
1652 SCEVHandle Base = UsersToProcess[i].Base;
1654 // Compact everything with this base to be consecutive with this one.
1655 for (unsigned j = i+1; j != e; ++j) {
1656 if (UsersToProcess[j].Base == Base) {
1657 std::swap(UsersToProcess[i+1], UsersToProcess[j]);
1664 /// PrepareToStrengthReduceFully - Prepare to fully strength-reduce
1665 /// UsersToProcess, meaning lowering addresses all the way down to direct
1666 /// pointer arithmetic.
1669 LoopStrengthReduce::PrepareToStrengthReduceFully(
1670 std::vector<BasedUser> &UsersToProcess,
1672 SCEVHandle CommonExprs,
1674 SCEVExpander &PreheaderRewriter) {
1675 DOUT << " Fully reducing all users\n";
1677 // Rewrite the UsersToProcess records, creating a separate PHI for each
1678 // unique Base value.
1679 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ) {
1680 // TODO: The uses are grouped by base, but not sorted. We arbitrarily
1681 // pick the first Imm value here to start with, and adjust it for the
1683 SCEVHandle Imm = UsersToProcess[i].Imm;
1684 SCEVHandle Base = UsersToProcess[i].Base;
1685 SCEVHandle Start = SE->getAddExpr(CommonExprs, Base, Imm);
1686 PHINode *Phi = InsertAffinePhi(Start, Stride, L,
1688 // Loop over all the users with the same base.
1690 UsersToProcess[i].Base = SE->getIntegerSCEV(0, Stride->getType());
1691 UsersToProcess[i].Imm = SE->getMinusSCEV(UsersToProcess[i].Imm, Imm);
1692 UsersToProcess[i].Phi = Phi;
1693 assert(UsersToProcess[i].Imm->isLoopInvariant(L) &&
1694 "ShouldUseFullStrengthReductionMode should reject this!");
1695 } while (++i != e && Base == UsersToProcess[i].Base);
1699 /// PrepareToStrengthReduceWithNewPhi - Insert a new induction variable for the
1700 /// given users to share.
1703 LoopStrengthReduce::PrepareToStrengthReduceWithNewPhi(
1704 std::vector<BasedUser> &UsersToProcess,
1706 SCEVHandle CommonExprs,
1709 SCEVExpander &PreheaderRewriter) {
1710 DOUT << " Inserting new PHI:\n";
1712 PHINode *Phi = InsertAffinePhi(SE->getUnknown(CommonBaseV),
1716 // Remember this in case a later stride is multiple of this.
1717 IVsByStride[Stride].addIV(Stride, CommonExprs, Phi);
1719 // All the users will share this new IV.
1720 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1721 UsersToProcess[i].Phi = Phi;
1724 DEBUG(WriteAsOperand(*DOUT, Phi, /*PrintType=*/false));
1728 /// PrepareToStrengthReduceWithNewPhi - Prepare for the given users to reuse
1729 /// an induction variable with a stride that is a factor of the current
1730 /// induction variable.
1733 LoopStrengthReduce::PrepareToStrengthReduceFromSmallerStride(
1734 std::vector<BasedUser> &UsersToProcess,
1736 const IVExpr &ReuseIV,
1737 Instruction *PreInsertPt) {
1738 DOUT << " Rewriting in terms of existing IV of STRIDE " << *ReuseIV.Stride
1739 << " and BASE " << *ReuseIV.Base << "\n";
1741 // All the users will share the reused IV.
1742 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1743 UsersToProcess[i].Phi = ReuseIV.PHI;
1745 Constant *C = dyn_cast<Constant>(CommonBaseV);
1747 (!C->isNullValue() &&
1748 !fitsInAddressMode(SE->getUnknown(CommonBaseV), CommonBaseV->getType(),
1750 // We want the common base emitted into the preheader! This is just
1751 // using cast as a copy so BitCast (no-op cast) is appropriate
1752 CommonBaseV = new BitCastInst(CommonBaseV, CommonBaseV->getType(),
1753 "commonbase", PreInsertPt);
1756 static bool IsImmFoldedIntoAddrMode(GlobalValue *GV, int64_t Offset,
1757 const Type *AccessTy,
1758 std::vector<BasedUser> &UsersToProcess,
1759 const TargetLowering *TLI) {
1760 SmallVector<Instruction*, 16> AddrModeInsts;
1761 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1762 if (UsersToProcess[i].isUseOfPostIncrementedValue)
1764 ExtAddrMode AddrMode =
1765 AddressingModeMatcher::Match(UsersToProcess[i].OperandValToReplace,
1766 AccessTy, UsersToProcess[i].Inst,
1767 AddrModeInsts, *TLI);
1768 if (GV && GV != AddrMode.BaseGV)
1770 if (Offset && !AddrMode.BaseOffs)
1771 // FIXME: How to accurate check it's immediate offset is folded.
1773 AddrModeInsts.clear();
1778 /// StrengthReduceStridedIVUsers - Strength reduce all of the users of a single
1779 /// stride of IV. All of the users may have different starting values, and this
1780 /// may not be the only stride.
1781 void LoopStrengthReduce::StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
1782 IVUsersOfOneStride &Uses,
1784 // If all the users are moved to another stride, then there is nothing to do.
1785 if (Uses.Users.empty())
1788 // Keep track if every use in UsersToProcess is an address. If they all are,
1789 // we may be able to rewrite the entire collection of them in terms of a
1790 // smaller-stride IV.
1791 bool AllUsesAreAddresses = true;
1793 // Keep track if every use of a single stride is outside the loop. If so,
1794 // we want to be more aggressive about reusing a smaller-stride IV; a
1795 // multiply outside the loop is better than another IV inside. Well, usually.
1796 bool AllUsesAreOutsideLoop = true;
1798 // Transform our list of users and offsets to a bit more complex table. In
1799 // this new vector, each 'BasedUser' contains 'Base' the base of the
1800 // strided accessas well as the old information from Uses. We progressively
1801 // move information from the Base field to the Imm field, until we eventually
1802 // have the full access expression to rewrite the use.
1803 std::vector<BasedUser> UsersToProcess;
1804 SCEVHandle CommonExprs = CollectIVUsers(Stride, Uses, L, AllUsesAreAddresses,
1805 AllUsesAreOutsideLoop,
1808 // Sort the UsersToProcess array so that users with common bases are
1809 // next to each other.
1810 SortUsersToProcess(UsersToProcess);
1812 // If we managed to find some expressions in common, we'll need to carry
1813 // their value in a register and add it in for each use. This will take up
1814 // a register operand, which potentially restricts what stride values are
1816 bool HaveCommonExprs = !CommonExprs->isZero();
1818 const Type *ReplacedTy = CommonExprs->getType();
1820 // If all uses are addresses, consider sinking the immediate part of the
1821 // common expression back into uses if they can fit in the immediate fields.
1822 if (TLI && HaveCommonExprs && AllUsesAreAddresses) {
1823 SCEVHandle NewCommon = CommonExprs;
1824 SCEVHandle Imm = SE->getIntegerSCEV(0, ReplacedTy);
1825 MoveImmediateValues(TLI, Type::VoidTy, NewCommon, Imm, true, L, SE);
1826 if (!Imm->isZero()) {
1829 // If the immediate part of the common expression is a GV, check if it's
1830 // possible to fold it into the target addressing mode.
1831 GlobalValue *GV = 0;
1832 if (SCEVUnknown *SU = dyn_cast<SCEVUnknown>(Imm)) {
1833 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(SU->getValue()))
1834 if (CE->getOpcode() == Instruction::PtrToInt)
1835 GV = dyn_cast<GlobalValue>(CE->getOperand(0));
1838 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Imm))
1839 Offset = SC->getValue()->getSExtValue();
1841 // Pass VoidTy as the AccessTy to be conservative, because
1842 // there could be multiple access types among all the uses.
1843 DoSink = IsImmFoldedIntoAddrMode(GV, Offset, Type::VoidTy,
1844 UsersToProcess, TLI);
1847 DOUT << " Sinking " << *Imm << " back down into uses\n";
1848 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i)
1849 UsersToProcess[i].Imm = SE->getAddExpr(UsersToProcess[i].Imm, Imm);
1850 CommonExprs = NewCommon;
1851 HaveCommonExprs = !CommonExprs->isZero();
1857 // Now that we know what we need to do, insert the PHI node itself.
1859 DOUT << "LSR: Examining IVs of TYPE " << *ReplacedTy << " of STRIDE "
1861 << " Common base: " << *CommonExprs << "\n";
1863 SCEVExpander Rewriter(*SE, *LI);
1864 SCEVExpander PreheaderRewriter(*SE, *LI);
1866 BasicBlock *Preheader = L->getLoopPreheader();
1867 Instruction *PreInsertPt = Preheader->getTerminator();
1868 BasicBlock *LatchBlock = L->getLoopLatch();
1870 Value *CommonBaseV = ConstantInt::get(ReplacedTy, 0);
1872 SCEVHandle RewriteFactor = SE->getIntegerSCEV(0, ReplacedTy);
1873 IVExpr ReuseIV(SE->getIntegerSCEV(0, Type::Int32Ty),
1874 SE->getIntegerSCEV(0, Type::Int32Ty),
1877 /// Choose a strength-reduction strategy and prepare for it by creating
1878 /// the necessary PHIs and adjusting the bookkeeping.
1879 if (ShouldUseFullStrengthReductionMode(UsersToProcess, L,
1880 AllUsesAreAddresses, Stride)) {
1881 PrepareToStrengthReduceFully(UsersToProcess, Stride, CommonExprs, L,
1884 // Emit the initial base value into the loop preheader.
1885 CommonBaseV = PreheaderRewriter.expandCodeFor(CommonExprs, PreInsertPt);
1887 // If all uses are addresses, check if it is possible to reuse an IV with a
1888 // stride that is a factor of this stride. And that the multiple is a number
1889 // that can be encoded in the scale field of the target addressing mode. And
1890 // that we will have a valid instruction after this substition, including
1891 // the immediate field, if any.
1892 RewriteFactor = CheckForIVReuse(HaveCommonExprs, AllUsesAreAddresses,
1893 AllUsesAreOutsideLoop,
1894 Stride, ReuseIV, ReplacedTy,
1896 if (isa<SCEVConstant>(RewriteFactor) &&
1897 cast<SCEVConstant>(RewriteFactor)->isZero())
1898 PrepareToStrengthReduceWithNewPhi(UsersToProcess, Stride, CommonExprs,
1899 CommonBaseV, L, PreheaderRewriter);
1901 PrepareToStrengthReduceFromSmallerStride(UsersToProcess, CommonBaseV,
1902 ReuseIV, PreInsertPt);
1905 // Process all the users now, replacing their strided uses with
1906 // strength-reduced forms. This outer loop handles all bases, the inner
1907 // loop handles all users of a particular base.
1908 while (!UsersToProcess.empty()) {
1909 SCEVHandle Base = UsersToProcess.back().Base;
1910 Instruction *Inst = UsersToProcess.back().Inst;
1912 // Emit the code for Base into the preheader.
1913 Value *BaseV = PreheaderRewriter.expandCodeFor(Base, PreInsertPt);
1915 DOUT << " Examining uses with BASE ";
1916 DEBUG(WriteAsOperand(*DOUT, BaseV, /*PrintType=*/false));
1919 // If BaseV is a constant other than 0, make sure that it gets inserted into
1920 // the preheader, instead of being forward substituted into the uses. We do
1921 // this by forcing a BitCast (noop cast) to be inserted into the preheader
1923 if (Constant *C = dyn_cast<Constant>(BaseV)) {
1924 if (!C->isNullValue() && !fitsInAddressMode(Base, getAccessType(Inst),
1926 // We want this constant emitted into the preheader! This is just
1927 // using cast as a copy so BitCast (no-op cast) is appropriate
1928 BaseV = new BitCastInst(BaseV, BaseV->getType(), "preheaderinsert",
1933 // Emit the code to add the immediate offset to the Phi value, just before
1934 // the instructions that we identified as using this stride and base.
1936 // FIXME: Use emitted users to emit other users.
1937 BasedUser &User = UsersToProcess.back();
1939 DOUT << " Examining use ";
1940 DEBUG(WriteAsOperand(*DOUT, UsersToProcess.back().OperandValToReplace,
1941 /*PrintType=*/false));
1942 DOUT << " in Inst: " << *Inst;
1944 // If this instruction wants to use the post-incremented value, move it
1945 // after the post-inc and use its value instead of the PHI.
1946 Value *RewriteOp = User.Phi;
1947 if (User.isUseOfPostIncrementedValue) {
1948 RewriteOp = User.Phi->getIncomingValueForBlock(LatchBlock);
1950 // If this user is in the loop, make sure it is the last thing in the
1951 // loop to ensure it is dominated by the increment.
1952 if (L->contains(User.Inst->getParent()))
1953 User.Inst->moveBefore(LatchBlock->getTerminator());
1955 if (RewriteOp->getType() != ReplacedTy) {
1956 Instruction::CastOps opcode = Instruction::Trunc;
1957 if (ReplacedTy->getPrimitiveSizeInBits() ==
1958 RewriteOp->getType()->getPrimitiveSizeInBits())
1959 opcode = Instruction::BitCast;
1960 RewriteOp = SCEVExpander::InsertCastOfTo(opcode, RewriteOp, ReplacedTy);
1963 SCEVHandle RewriteExpr = SE->getUnknown(RewriteOp);
1965 // If we had to insert new instructions for RewriteOp, we have to
1966 // consider that they may not have been able to end up immediately
1967 // next to RewriteOp, because non-PHI instructions may never precede
1968 // PHI instructions in a block. In this case, remember where the last
1969 // instruction was inserted so that if we're replacing a different
1970 // PHI node, we can use the later point to expand the final
1972 Instruction *NewBasePt = dyn_cast<Instruction>(RewriteOp);
1973 if (RewriteOp == User.Phi) NewBasePt = 0;
1975 // Clear the SCEVExpander's expression map so that we are guaranteed
1976 // to have the code emitted where we expect it.
1979 // If we are reusing the iv, then it must be multiplied by a constant
1980 // factor to take advantage of the addressing mode scale component.
1981 if (!isa<SCEVConstant>(RewriteFactor) ||
1982 !cast<SCEVConstant>(RewriteFactor)->isZero()) {
1983 // If we're reusing an IV with a nonzero base (currently this happens
1984 // only when all reuses are outside the loop) subtract that base here.
1985 // The base has been used to initialize the PHI node but we don't want
1987 if (!ReuseIV.Base->isZero()) {
1988 SCEVHandle typedBase = ReuseIV.Base;
1989 if (RewriteExpr->getType()->getPrimitiveSizeInBits() !=
1990 ReuseIV.Base->getType()->getPrimitiveSizeInBits()) {
1991 // It's possible the original IV is a larger type than the new IV,
1992 // in which case we have to truncate the Base. We checked in
1993 // RequiresTypeConversion that this is valid.
1994 assert (RewriteExpr->getType()->getPrimitiveSizeInBits() <
1995 ReuseIV.Base->getType()->getPrimitiveSizeInBits() &&
1996 "Unexpected lengthening conversion!");
1997 typedBase = SE->getTruncateExpr(ReuseIV.Base,
1998 RewriteExpr->getType());
2000 RewriteExpr = SE->getMinusSCEV(RewriteExpr, typedBase);
2003 // Multiply old variable, with base removed, by new scale factor.
2004 RewriteExpr = SE->getMulExpr(RewriteFactor,
2007 // The common base is emitted in the loop preheader. But since we
2008 // are reusing an IV, it has not been used to initialize the PHI node.
2009 // Add it to the expression used to rewrite the uses.
2010 // When this use is outside the loop, we earlier subtracted the
2011 // common base, and are adding it back here. Use the same expression
2012 // as before, rather than CommonBaseV, so DAGCombiner will zap it.
2013 if (!isa<ConstantInt>(CommonBaseV) ||
2014 !cast<ConstantInt>(CommonBaseV)->isZero()) {
2015 if (L->contains(User.Inst->getParent()))
2016 RewriteExpr = SE->getAddExpr(RewriteExpr,
2017 SE->getUnknown(CommonBaseV));
2019 RewriteExpr = SE->getAddExpr(RewriteExpr, CommonExprs);
2023 // Now that we know what we need to do, insert code before User for the
2024 // immediate and any loop-variant expressions.
2025 if (!isa<ConstantInt>(BaseV) || !cast<ConstantInt>(BaseV)->isZero())
2026 // Add BaseV to the PHI value if needed.
2027 RewriteExpr = SE->getAddExpr(RewriteExpr, SE->getUnknown(BaseV));
2029 User.RewriteInstructionToUseNewBase(RewriteExpr, NewBasePt,
2033 // Mark old value we replaced as possibly dead, so that it is eliminated
2034 // if we just replaced the last use of that value.
2035 DeadInsts.push_back(cast<Instruction>(User.OperandValToReplace));
2037 UsersToProcess.pop_back();
2040 // If there are any more users to process with the same base, process them
2041 // now. We sorted by base above, so we just have to check the last elt.
2042 } while (!UsersToProcess.empty() && UsersToProcess.back().Base == Base);
2043 // TODO: Next, find out which base index is the most common, pull it out.
2046 // IMPORTANT TODO: Figure out how to partition the IV's with this stride, but
2047 // different starting values, into different PHIs.
2050 /// FindIVUserForCond - If Cond has an operand that is an expression of an IV,
2051 /// set the IV user and stride information and return true, otherwise return
2053 bool LoopStrengthReduce::FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse,
2054 const SCEVHandle *&CondStride) {
2055 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e && !CondUse;
2057 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2058 IVUsesByStride.find(StrideOrder[Stride]);
2059 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
2061 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
2062 E = SI->second.Users.end(); UI != E; ++UI)
2063 if (UI->User == Cond) {
2064 // NOTE: we could handle setcc instructions with multiple uses here, but
2065 // InstCombine does it as well for simple uses, it's not clear that it
2066 // occurs enough in real life to handle.
2068 CondStride = &SI->first;
2076 // Constant strides come first which in turns are sorted by their absolute
2077 // values. If absolute values are the same, then positive strides comes first.
2079 // 4, -1, X, 1, 2 ==> 1, -1, 2, 4, X
2080 struct StrideCompare {
2081 bool operator()(const SCEVHandle &LHS, const SCEVHandle &RHS) {
2082 SCEVConstant *LHSC = dyn_cast<SCEVConstant>(LHS);
2083 SCEVConstant *RHSC = dyn_cast<SCEVConstant>(RHS);
2085 int64_t LV = LHSC->getValue()->getSExtValue();
2086 int64_t RV = RHSC->getValue()->getSExtValue();
2087 uint64_t ALV = (LV < 0) ? -LV : LV;
2088 uint64_t ARV = (RV < 0) ? -RV : RV;
2096 // If it's the same value but different type, sort by bit width so
2097 // that we emit larger induction variables before smaller
2098 // ones, letting the smaller be re-written in terms of larger ones.
2099 return RHS->getBitWidth() < LHS->getBitWidth();
2101 return LHSC && !RHSC;
2106 /// ChangeCompareStride - If a loop termination compare instruction is the
2107 /// only use of its stride, and the compaison is against a constant value,
2108 /// try eliminate the stride by moving the compare instruction to another
2109 /// stride and change its constant operand accordingly. e.g.
2115 /// if (v2 < 10) goto loop
2120 /// if (v1 < 30) goto loop
2121 ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
2122 IVStrideUse* &CondUse,
2123 const SCEVHandle* &CondStride) {
2124 if (StrideOrder.size() < 2 ||
2125 IVUsesByStride[*CondStride].Users.size() != 1)
2127 const SCEVConstant *SC = dyn_cast<SCEVConstant>(*CondStride);
2128 if (!SC) return Cond;
2130 ICmpInst::Predicate Predicate = Cond->getPredicate();
2131 int64_t CmpSSInt = SC->getValue()->getSExtValue();
2132 unsigned BitWidth = (*CondStride)->getBitWidth();
2133 uint64_t SignBit = 1ULL << (BitWidth-1);
2134 const Type *CmpTy = Cond->getOperand(0)->getType();
2135 const Type *NewCmpTy = NULL;
2136 unsigned TyBits = CmpTy->getPrimitiveSizeInBits();
2137 unsigned NewTyBits = 0;
2138 SCEVHandle *NewStride = NULL;
2139 Value *NewCmpLHS = NULL;
2140 Value *NewCmpRHS = NULL;
2142 SCEVHandle NewOffset = SE->getIntegerSCEV(0, UIntPtrTy);
2144 if (ConstantInt *C = dyn_cast<ConstantInt>(Cond->getOperand(1))) {
2145 int64_t CmpVal = C->getValue().getSExtValue();
2147 // Check stride constant and the comparision constant signs to detect
2149 if ((CmpVal & SignBit) != (CmpSSInt & SignBit))
2152 // Look for a suitable stride / iv as replacement.
2153 for (unsigned i = 0, e = StrideOrder.size(); i != e; ++i) {
2154 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2155 IVUsesByStride.find(StrideOrder[i]);
2156 if (!isa<SCEVConstant>(SI->first))
2158 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
2159 if (abs(SSInt) <= abs(CmpSSInt) || (SSInt % CmpSSInt) != 0)
2162 Scale = SSInt / CmpSSInt;
2163 int64_t NewCmpVal = CmpVal * Scale;
2164 APInt Mul = APInt(BitWidth, NewCmpVal);
2165 // Check for overflow.
2166 if (Mul.getSExtValue() != NewCmpVal)
2169 // Watch out for overflow.
2170 if (ICmpInst::isSignedPredicate(Predicate) &&
2171 (CmpVal & SignBit) != (NewCmpVal & SignBit))
2174 if (NewCmpVal == CmpVal)
2176 // Pick the best iv to use trying to avoid a cast.
2178 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
2179 E = SI->second.Users.end(); UI != E; ++UI) {
2180 NewCmpLHS = UI->OperandValToReplace;
2181 if (NewCmpLHS->getType() == CmpTy)
2187 NewCmpTy = NewCmpLHS->getType();
2188 NewTyBits = isa<PointerType>(NewCmpTy)
2189 ? UIntPtrTy->getPrimitiveSizeInBits()
2190 : NewCmpTy->getPrimitiveSizeInBits();
2191 if (RequiresTypeConversion(NewCmpTy, CmpTy)) {
2192 // Check if it is possible to rewrite it using
2193 // an iv / stride of a smaller integer type.
2194 bool TruncOk = false;
2195 if (NewCmpTy->isInteger()) {
2196 unsigned Bits = NewTyBits;
2197 if (ICmpInst::isSignedPredicate(Predicate))
2199 uint64_t Mask = (1ULL << Bits) - 1;
2200 if (((uint64_t)NewCmpVal & Mask) == (uint64_t)NewCmpVal)
2207 // Don't rewrite if use offset is non-constant and the new type is
2208 // of a different type.
2209 // FIXME: too conservative?
2210 if (NewTyBits != TyBits && !isa<SCEVConstant>(CondUse->Offset))
2213 bool AllUsesAreAddresses = true;
2214 bool AllUsesAreOutsideLoop = true;
2215 std::vector<BasedUser> UsersToProcess;
2216 SCEVHandle CommonExprs = CollectIVUsers(SI->first, SI->second, L,
2217 AllUsesAreAddresses,
2218 AllUsesAreOutsideLoop,
2220 // Avoid rewriting the compare instruction with an iv of new stride
2221 // if it's likely the new stride uses will be rewritten using the
2222 // stride of the compare instruction.
2223 if (AllUsesAreAddresses &&
2224 ValidStride(!CommonExprs->isZero(), Scale, UsersToProcess))
2227 // If scale is negative, use swapped predicate unless it's testing
2229 if (Scale < 0 && !Cond->isEquality())
2230 Predicate = ICmpInst::getSwappedPredicate(Predicate);
2232 NewStride = &StrideOrder[i];
2233 if (!isa<PointerType>(NewCmpTy))
2234 NewCmpRHS = ConstantInt::get(NewCmpTy, NewCmpVal);
2236 NewCmpRHS = ConstantInt::get(UIntPtrTy, NewCmpVal);
2237 NewCmpRHS = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr,
2238 NewCmpRHS, NewCmpTy);
2240 NewOffset = TyBits == NewTyBits
2241 ? SE->getMulExpr(CondUse->Offset,
2242 SE->getConstant(ConstantInt::get(CmpTy, Scale)))
2243 : SE->getConstant(ConstantInt::get(NewCmpTy,
2244 cast<SCEVConstant>(CondUse->Offset)->getValue()->getSExtValue()*Scale));
2249 // Forgo this transformation if it the increment happens to be
2250 // unfortunately positioned after the condition, and the condition
2251 // has multiple uses which prevent it from being moved immediately
2252 // before the branch. See
2253 // test/Transforms/LoopStrengthReduce/change-compare-stride-trickiness-*.ll
2254 // for an example of this situation.
2255 if (!Cond->hasOneUse()) {
2256 for (BasicBlock::iterator I = Cond, E = Cond->getParent()->end();
2263 // Create a new compare instruction using new stride / iv.
2264 ICmpInst *OldCond = Cond;
2265 // Insert new compare instruction.
2266 Cond = new ICmpInst(Predicate, NewCmpLHS, NewCmpRHS,
2267 L->getHeader()->getName() + ".termcond",
2270 // Remove the old compare instruction. The old indvar is probably dead too.
2271 DeadInsts.push_back(cast<Instruction>(CondUse->OperandValToReplace));
2272 SE->deleteValueFromRecords(OldCond);
2273 OldCond->replaceAllUsesWith(Cond);
2274 OldCond->eraseFromParent();
2276 IVUsesByStride[*CondStride].Users.pop_back();
2277 IVUsesByStride[*NewStride].addUser(NewOffset, Cond, NewCmpLHS);
2278 CondUse = &IVUsesByStride[*NewStride].Users.back();
2279 CondStride = NewStride;
2286 /// OptimizeSMax - Rewrite the loop's terminating condition if it uses
2287 /// an smax computation.
2289 /// This is a narrow solution to a specific, but acute, problem. For loops
2295 /// } while (++i < n);
2297 /// where the comparison is signed, the trip count isn't just 'n', because
2298 /// 'n' could be negative. And unfortunately this can come up even for loops
2299 /// where the user didn't use a C do-while loop. For example, seemingly
2300 /// well-behaved top-test loops will commonly be lowered like this:
2306 /// } while (++i < n);
2309 /// and then it's possible for subsequent optimization to obscure the if
2310 /// test in such a way that indvars can't find it.
2312 /// When indvars can't find the if test in loops like this, it creates a
2313 /// signed-max expression, which allows it to give the loop a canonical
2314 /// induction variable:
2317 /// smax = n < 1 ? 1 : n;
2320 /// } while (++i != smax);
2322 /// Canonical induction variables are necessary because the loop passes
2323 /// are designed around them. The most obvious example of this is the
2324 /// LoopInfo analysis, which doesn't remember trip count values. It
2325 /// expects to be able to rediscover the trip count each time it is
2326 /// needed, and it does this using a simple analyis that only succeeds if
2327 /// the loop has a canonical induction variable.
2329 /// However, when it comes time to generate code, the maximum operation
2330 /// can be quite costly, especially if it's inside of an outer loop.
2332 /// This function solves this problem by detecting this type of loop and
2333 /// rewriting their conditions from ICMP_NE back to ICMP_SLT, and deleting
2334 /// the instructions for the maximum computation.
2336 ICmpInst *LoopStrengthReduce::OptimizeSMax(Loop *L, ICmpInst *Cond,
2337 IVStrideUse* &CondUse) {
2338 // Check that the loop matches the pattern we're looking for.
2339 if (Cond->getPredicate() != CmpInst::ICMP_EQ &&
2340 Cond->getPredicate() != CmpInst::ICMP_NE)
2343 SelectInst *Sel = dyn_cast<SelectInst>(Cond->getOperand(1));
2344 if (!Sel || !Sel->hasOneUse()) return Cond;
2346 SCEVHandle BackedgeTakenCount = SE->getBackedgeTakenCount(L);
2347 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
2349 SCEVHandle One = SE->getIntegerSCEV(1, BackedgeTakenCount->getType());
2351 // Add one to the backedge-taken count to get the trip count.
2352 SCEVHandle IterationCount = SE->getAddExpr(BackedgeTakenCount, One);
2354 // Check for a max calculation that matches the pattern.
2355 SCEVSMaxExpr *SMax = dyn_cast<SCEVSMaxExpr>(IterationCount);
2356 if (!SMax || SMax != SE->getSCEV(Sel)) return Cond;
2358 SCEVHandle SMaxLHS = SMax->getOperand(0);
2359 SCEVHandle SMaxRHS = SMax->getOperand(1);
2360 if (!SMaxLHS || SMaxLHS != One) return Cond;
2362 // Check the relevant induction variable for conformance to
2364 SCEVHandle IV = SE->getSCEV(Cond->getOperand(0));
2365 SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV);
2366 if (!AR || !AR->isAffine() ||
2367 AR->getStart() != One ||
2368 AR->getStepRecurrence(*SE) != One)
2371 assert(AR->getLoop() == L &&
2372 "Loop condition operand is an addrec in a different loop!");
2374 // Check the right operand of the select, and remember it, as it will
2375 // be used in the new comparison instruction.
2377 if (SE->getSCEV(Sel->getOperand(1)) == SMaxRHS)
2378 NewRHS = Sel->getOperand(1);
2379 else if (SE->getSCEV(Sel->getOperand(2)) == SMaxRHS)
2380 NewRHS = Sel->getOperand(2);
2381 if (!NewRHS) return Cond;
2383 // Ok, everything looks ok to change the condition into an SLT or SGE and
2384 // delete the max calculation.
2386 new ICmpInst(Cond->getPredicate() == CmpInst::ICMP_NE ?
2389 Cond->getOperand(0), NewRHS, "scmp", Cond);
2391 // Delete the max calculation instructions.
2392 SE->deleteValueFromRecords(Cond);
2393 Cond->replaceAllUsesWith(NewCond);
2394 Cond->eraseFromParent();
2395 Instruction *Cmp = cast<Instruction>(Sel->getOperand(0));
2396 SE->deleteValueFromRecords(Sel);
2397 Sel->eraseFromParent();
2398 if (Cmp->use_empty()) {
2399 SE->deleteValueFromRecords(Cmp);
2400 Cmp->eraseFromParent();
2402 CondUse->User = NewCond;
2406 /// OptimizeShadowIV - If IV is used in a int-to-float cast
2407 /// inside the loop then try to eliminate the cast opeation.
2408 void LoopStrengthReduce::OptimizeShadowIV(Loop *L) {
2410 SCEVHandle BackedgeTakenCount = SE->getBackedgeTakenCount(L);
2411 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
2414 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e;
2416 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2417 IVUsesByStride.find(StrideOrder[Stride]);
2418 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
2419 if (!isa<SCEVConstant>(SI->first))
2422 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
2423 E = SI->second.Users.end(); UI != E; /* empty */) {
2424 std::vector<IVStrideUse>::iterator CandidateUI = UI;
2426 Instruction *ShadowUse = CandidateUI->User;
2427 const Type *DestTy = NULL;
2429 /* If shadow use is a int->float cast then insert a second IV
2430 to eliminate this cast.
2432 for (unsigned i = 0; i < n; ++i)
2438 for (unsigned i = 0; i < n; ++i, ++d)
2441 if (UIToFPInst *UCast = dyn_cast<UIToFPInst>(CandidateUI->User))
2442 DestTy = UCast->getDestTy();
2443 else if (SIToFPInst *SCast = dyn_cast<SIToFPInst>(CandidateUI->User))
2444 DestTy = SCast->getDestTy();
2445 if (!DestTy) continue;
2448 /* If target does not support DestTy natively then do not apply
2449 this transformation. */
2450 MVT DVT = TLI->getValueType(DestTy);
2451 if (!TLI->isTypeLegal(DVT)) continue;
2454 PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0));
2456 if (PH->getNumIncomingValues() != 2) continue;
2458 const Type *SrcTy = PH->getType();
2459 int Mantissa = DestTy->getFPMantissaWidth();
2460 if (Mantissa == -1) continue;
2461 if ((int)TD->getTypeSizeInBits(SrcTy) > Mantissa)
2464 unsigned Entry, Latch;
2465 if (PH->getIncomingBlock(0) == L->getLoopPreheader()) {
2473 ConstantInt *Init = dyn_cast<ConstantInt>(PH->getIncomingValue(Entry));
2474 if (!Init) continue;
2475 ConstantFP *NewInit = ConstantFP::get(DestTy, Init->getZExtValue());
2477 BinaryOperator *Incr =
2478 dyn_cast<BinaryOperator>(PH->getIncomingValue(Latch));
2479 if (!Incr) continue;
2480 if (Incr->getOpcode() != Instruction::Add
2481 && Incr->getOpcode() != Instruction::Sub)
2484 /* Initialize new IV, double d = 0.0 in above example. */
2485 ConstantInt *C = NULL;
2486 if (Incr->getOperand(0) == PH)
2487 C = dyn_cast<ConstantInt>(Incr->getOperand(1));
2488 else if (Incr->getOperand(1) == PH)
2489 C = dyn_cast<ConstantInt>(Incr->getOperand(0));
2495 /* Add new PHINode. */
2496 PHINode *NewPH = PHINode::Create(DestTy, "IV.S.", PH);
2498 /* create new increment. '++d' in above example. */
2499 ConstantFP *CFP = ConstantFP::get(DestTy, C->getZExtValue());
2500 BinaryOperator *NewIncr =
2501 BinaryOperator::Create(Incr->getOpcode(),
2502 NewPH, CFP, "IV.S.next.", Incr);
2504 NewPH->addIncoming(NewInit, PH->getIncomingBlock(Entry));
2505 NewPH->addIncoming(NewIncr, PH->getIncomingBlock(Latch));
2507 /* Remove cast operation */
2508 SE->deleteValueFromRecords(ShadowUse);
2509 ShadowUse->replaceAllUsesWith(NewPH);
2510 ShadowUse->eraseFromParent();
2511 SI->second.Users.erase(CandidateUI);
2518 // OptimizeIndvars - Now that IVUsesByStride is set up with all of the indvar
2519 // uses in the loop, look to see if we can eliminate some, in favor of using
2520 // common indvars for the different uses.
2521 void LoopStrengthReduce::OptimizeIndvars(Loop *L) {
2522 // TODO: implement optzns here.
2524 OptimizeShadowIV(L);
2526 // Finally, get the terminating condition for the loop if possible. If we
2527 // can, we want to change it to use a post-incremented version of its
2528 // induction variable, to allow coalescing the live ranges for the IV into
2529 // one register value.
2530 PHINode *SomePHI = cast<PHINode>(L->getHeader()->begin());
2531 BasicBlock *Preheader = L->getLoopPreheader();
2532 BasicBlock *LatchBlock =
2533 SomePHI->getIncomingBlock(SomePHI->getIncomingBlock(0) == Preheader);
2534 BranchInst *TermBr = dyn_cast<BranchInst>(LatchBlock->getTerminator());
2535 if (!TermBr || TermBr->isUnconditional() ||
2536 !isa<ICmpInst>(TermBr->getCondition()))
2538 ICmpInst *Cond = cast<ICmpInst>(TermBr->getCondition());
2540 // Search IVUsesByStride to find Cond's IVUse if there is one.
2541 IVStrideUse *CondUse = 0;
2542 const SCEVHandle *CondStride = 0;
2544 if (!FindIVUserForCond(Cond, CondUse, CondStride))
2545 return; // setcc doesn't use the IV.
2547 // If the trip count is computed in terms of an smax (due to ScalarEvolution
2548 // being unable to find a sufficient guard, for example), change the loop
2549 // comparison to use SLT instead of NE.
2550 Cond = OptimizeSMax(L, Cond, CondUse);
2552 // If possible, change stride and operands of the compare instruction to
2553 // eliminate one stride.
2554 Cond = ChangeCompareStride(L, Cond, CondUse, CondStride);
2556 // It's possible for the setcc instruction to be anywhere in the loop, and
2557 // possible for it to have multiple users. If it is not immediately before
2558 // the latch block branch, move it.
2559 if (&*++BasicBlock::iterator(Cond) != (Instruction*)TermBr) {
2560 if (Cond->hasOneUse()) { // Condition has a single use, just move it.
2561 Cond->moveBefore(TermBr);
2563 // Otherwise, clone the terminating condition and insert into the loopend.
2564 Cond = cast<ICmpInst>(Cond->clone());
2565 Cond->setName(L->getHeader()->getName() + ".termcond");
2566 LatchBlock->getInstList().insert(TermBr, Cond);
2568 // Clone the IVUse, as the old use still exists!
2569 IVUsesByStride[*CondStride].addUser(CondUse->Offset, Cond,
2570 CondUse->OperandValToReplace);
2571 CondUse = &IVUsesByStride[*CondStride].Users.back();
2575 // If we get to here, we know that we can transform the setcc instruction to
2576 // use the post-incremented version of the IV, allowing us to coalesce the
2577 // live ranges for the IV correctly.
2578 CondUse->Offset = SE->getMinusSCEV(CondUse->Offset, *CondStride);
2579 CondUse->isUseOfPostIncrementedValue = true;
2583 bool LoopStrengthReduce::runOnLoop(Loop *L, LPPassManager &LPM) {
2585 LI = &getAnalysis<LoopInfo>();
2586 DT = &getAnalysis<DominatorTree>();
2587 SE = &getAnalysis<ScalarEvolution>();
2588 TD = &getAnalysis<TargetData>();
2589 UIntPtrTy = TD->getIntPtrType();
2592 // Find all uses of induction variables in this loop, and categorize
2593 // them by stride. Start by finding all of the PHI nodes in the header for
2594 // this loop. If they are induction variables, inspect their uses.
2595 SmallPtrSet<Instruction*,16> Processed; // Don't reprocess instructions.
2596 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I)
2597 AddUsersIfInteresting(I, L, Processed);
2599 if (!IVUsesByStride.empty()) {
2601 DOUT << "\nLSR on \"" << L->getHeader()->getParent()->getNameStart()
2606 // Sort the StrideOrder so we process larger strides first.
2607 std::stable_sort(StrideOrder.begin(), StrideOrder.end(), StrideCompare());
2609 // Optimize induction variables. Some indvar uses can be transformed to use
2610 // strides that will be needed for other purposes. A common example of this
2611 // is the exit test for the loop, which can often be rewritten to use the
2612 // computation of some other indvar to decide when to terminate the loop.
2615 // FIXME: We can widen subreg IV's here for RISC targets. e.g. instead of
2616 // doing computation in byte values, promote to 32-bit values if safe.
2618 // FIXME: Attempt to reuse values across multiple IV's. In particular, we
2619 // could have something like "for(i) { foo(i*8); bar(i*16) }", which should
2620 // be codegened as "for (j = 0;; j+=8) { foo(j); bar(j+j); }" on X86/PPC.
2621 // Need to be careful that IV's are all the same type. Only works for
2622 // intptr_t indvars.
2624 // IVsByStride keeps IVs for one particular loop.
2625 assert(IVsByStride.empty() && "Stale entries in IVsByStride?");
2627 // Note: this processes each stride/type pair individually. All users
2628 // passed into StrengthReduceStridedIVUsers have the same type AND stride.
2629 // Also, note that we iterate over IVUsesByStride indirectly by using
2630 // StrideOrder. This extra layer of indirection makes the ordering of
2631 // strides deterministic - not dependent on map order.
2632 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e; ++Stride) {
2633 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
2634 IVUsesByStride.find(StrideOrder[Stride]);
2635 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
2636 StrengthReduceStridedIVUsers(SI->first, SI->second, L);
2640 // We're done analyzing this loop; release all the state we built up for it.
2641 CastedPointers.clear();
2642 IVUsesByStride.clear();
2643 IVsByStride.clear();
2644 StrideOrder.clear();
2645 for (unsigned i=0; i<GEPlist.size(); i++)
2646 SE->deleteValueFromRecords(GEPlist[i]);
2649 // Clean up after ourselves
2650 if (!DeadInsts.empty()) {
2651 DeleteTriviallyDeadInstructions();
2653 BasicBlock::iterator I = L->getHeader()->begin();
2654 while (PHINode *PN = dyn_cast<PHINode>(I++)) {
2655 // At this point, we know that we have killed one or more IV users.
2656 // It is worth checking to see if the cannonical indvar is also
2657 // dead, so that we can remove it as well.
2659 // We can remove a PHI if it is on a cycle in the def-use graph
2660 // where each node in the cycle has degree one, i.e. only one use,
2661 // and is an instruction with no side effects.
2663 // FIXME: this needs to eliminate an induction variable even if it's being
2664 // compared against some value to decide loop termination.
2665 if (!PN->hasOneUse())
2668 SmallPtrSet<PHINode *, 4> PHIs;
2669 for (Instruction *J = dyn_cast<Instruction>(*PN->use_begin());
2670 J && J->hasOneUse() && !J->mayWriteToMemory();
2671 J = dyn_cast<Instruction>(*J->use_begin())) {
2672 // If we find the original PHI, we've discovered a cycle.
2674 // Break the cycle and mark the PHI for deletion.
2675 SE->deleteValueFromRecords(PN);
2676 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
2677 DeadInsts.push_back(PN);
2681 // If we find a PHI more than once, we're on a cycle that
2682 // won't prove fruitful.
2683 if (isa<PHINode>(J) && !PHIs.insert(cast<PHINode>(J)))
2687 DeleteTriviallyDeadInstructions();