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/Support/CFG.h"
30 #include "llvm/Support/GetElementPtrTypeIterator.h"
31 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
32 #include "llvm/Transforms/Utils/Local.h"
33 #include "llvm/Target/TargetData.h"
34 #include "llvm/ADT/SetVector.h"
35 #include "llvm/ADT/SmallPtrSet.h"
36 #include "llvm/ADT/Statistic.h"
37 #include "llvm/Support/Debug.h"
38 #include "llvm/Support/Compiler.h"
39 #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 Shdow IVs optimized");
54 /// IVStrideUse - Keep track of one use of a strided induction variable, where
55 /// the stride is stored externally. The Offset member keeps track of the
56 /// offset from the IV, User is the actual user of the operand, and
57 /// 'OperandValToReplace' is the operand of the User that is the use.
58 struct VISIBILITY_HIDDEN IVStrideUse {
61 Value *OperandValToReplace;
63 // isUseOfPostIncrementedValue - True if this should use the
64 // post-incremented version of this IV, not the preincremented version.
65 // This can only be set in special cases, such as the terminating setcc
66 // instruction for a loop or uses dominated by the loop.
67 bool isUseOfPostIncrementedValue;
69 IVStrideUse(const SCEVHandle &Offs, Instruction *U, Value *O)
70 : Offset(Offs), User(U), OperandValToReplace(O),
71 isUseOfPostIncrementedValue(false) {}
74 /// IVUsersOfOneStride - This structure keeps track of all instructions that
75 /// have an operand that is based on the trip count multiplied by some stride.
76 /// The stride for all of these users is common and kept external to this
78 struct VISIBILITY_HIDDEN IVUsersOfOneStride {
79 /// Users - Keep track of all of the users of this stride as well as the
80 /// initial value and the operand that uses the IV.
81 std::vector<IVStrideUse> Users;
83 void addUser(const SCEVHandle &Offset,Instruction *User, Value *Operand) {
84 Users.push_back(IVStrideUse(Offset, User, Operand));
88 /// IVInfo - This structure keeps track of one IV expression inserted during
89 /// StrengthReduceStridedIVUsers. It contains the stride, the common base, as
90 /// well as the PHI node and increment value created for rewrite.
91 struct VISIBILITY_HIDDEN IVExpr {
97 IVExpr(const SCEVHandle &stride, const SCEVHandle &base, PHINode *phi,
99 : Stride(stride), Base(base), PHI(phi), IncV(incv) {}
102 /// IVsOfOneStride - This structure keeps track of all IV expression inserted
103 /// during StrengthReduceStridedIVUsers for a particular stride of the IV.
104 struct VISIBILITY_HIDDEN IVsOfOneStride {
105 std::vector<IVExpr> IVs;
107 void addIV(const SCEVHandle &Stride, const SCEVHandle &Base, PHINode *PHI,
109 IVs.push_back(IVExpr(Stride, Base, PHI, IncV));
113 class VISIBILITY_HIDDEN LoopStrengthReduce : public LoopPass {
117 const TargetData *TD;
118 const Type *UIntPtrTy;
121 /// IVUsesByStride - Keep track of all uses of induction variables that we
122 /// are interested in. The key of the map is the stride of the access.
123 std::map<SCEVHandle, IVUsersOfOneStride> IVUsesByStride;
125 /// IVsByStride - Keep track of all IVs that have been inserted for a
126 /// particular stride.
127 std::map<SCEVHandle, IVsOfOneStride> IVsByStride;
129 /// StrideOrder - An ordering of the keys in IVUsesByStride that is stable:
130 /// We use this to iterate over the IVUsesByStride collection without being
131 /// dependent on random ordering of pointers in the process.
132 SmallVector<SCEVHandle, 16> StrideOrder;
134 /// CastedValues - As we need to cast values to uintptr_t, this keeps track
135 /// of the casted version of each value. This is accessed by
136 /// getCastedVersionOf.
137 DenseMap<Value*, Value*> CastedPointers;
139 /// DeadInsts - Keep track of instructions we may have made dead, so that
140 /// we can remove them after we are done working.
141 SetVector<Instruction*> DeadInsts;
143 /// TLI - Keep a pointer of a TargetLowering to consult for determining
144 /// transformation profitability.
145 const TargetLowering *TLI;
148 static char ID; // Pass ID, replacement for typeid
149 explicit LoopStrengthReduce(const TargetLowering *tli = NULL) :
150 LoopPass((intptr_t)&ID), TLI(tli) {
153 bool runOnLoop(Loop *L, LPPassManager &LPM);
155 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
156 // We split critical edges, so we change the CFG. However, we do update
157 // many analyses if they are around.
158 AU.addPreservedID(LoopSimplifyID);
159 AU.addPreserved<LoopInfo>();
160 AU.addPreserved<DominanceFrontier>();
161 AU.addPreserved<DominatorTree>();
163 AU.addRequiredID(LoopSimplifyID);
164 AU.addRequired<LoopInfo>();
165 AU.addRequired<DominatorTree>();
166 AU.addRequired<TargetData>();
167 AU.addRequired<ScalarEvolution>();
170 /// getCastedVersionOf - Return the specified value casted to uintptr_t.
172 Value *getCastedVersionOf(Instruction::CastOps opcode, Value *V);
174 bool AddUsersIfInteresting(Instruction *I, Loop *L,
175 SmallPtrSet<Instruction*,16> &Processed);
176 SCEVHandle GetExpressionSCEV(Instruction *E);
177 ICmpInst *ChangeCompareStride(Loop *L, ICmpInst *Cond,
178 IVStrideUse* &CondUse,
179 const SCEVHandle* &CondStride);
180 void OptimizeIndvars(Loop *L);
182 /// OptimizeShadowIV - If IV is used in a int-to-float cast
183 /// inside the loop then try to eliminate the cast opeation.
184 void OptimizeShadowIV(Loop *L);
185 bool FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse,
186 const SCEVHandle *&CondStride);
187 bool RequiresTypeConversion(const Type *Ty, const Type *NewTy);
188 unsigned CheckForIVReuse(bool, bool, const SCEVHandle&,
189 IVExpr&, const Type*,
190 const std::vector<BasedUser>& UsersToProcess);
191 bool ValidStride(bool, int64_t,
192 const std::vector<BasedUser>& UsersToProcess);
193 SCEVHandle CollectIVUsers(const SCEVHandle &Stride,
194 IVUsersOfOneStride &Uses,
196 bool &AllUsesAreAddresses,
197 std::vector<BasedUser> &UsersToProcess);
198 void StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
199 IVUsersOfOneStride &Uses,
200 Loop *L, bool isOnlyStride);
201 void DeleteTriviallyDeadInstructions(SetVector<Instruction*> &Insts);
205 char LoopStrengthReduce::ID = 0;
206 static RegisterPass<LoopStrengthReduce>
207 X("loop-reduce", "Loop Strength Reduction");
209 LoopPass *llvm::createLoopStrengthReducePass(const TargetLowering *TLI) {
210 return new LoopStrengthReduce(TLI);
213 /// getCastedVersionOf - Return the specified value casted to uintptr_t. This
214 /// assumes that the Value* V is of integer or pointer type only.
216 Value *LoopStrengthReduce::getCastedVersionOf(Instruction::CastOps opcode,
218 if (V->getType() == UIntPtrTy) return V;
219 if (Constant *CB = dyn_cast<Constant>(V))
220 return ConstantExpr::getCast(opcode, CB, UIntPtrTy);
222 Value *&New = CastedPointers[V];
225 New = SCEVExpander::InsertCastOfTo(opcode, V, UIntPtrTy);
226 DeadInsts.insert(cast<Instruction>(New));
231 /// DeleteTriviallyDeadInstructions - If any of the instructions is the
232 /// specified set are trivially dead, delete them and see if this makes any of
233 /// their operands subsequently dead.
234 void LoopStrengthReduce::
235 DeleteTriviallyDeadInstructions(SetVector<Instruction*> &Insts) {
236 while (!Insts.empty()) {
237 Instruction *I = Insts.back();
240 if (PHINode *PN = dyn_cast<PHINode>(I)) {
241 // If all incoming values to the Phi are the same, we can replace the Phi
243 if (Value *PNV = PN->hasConstantValue()) {
244 if (Instruction *U = dyn_cast<Instruction>(PNV))
246 SE->deleteValueFromRecords(PN);
247 PN->replaceAllUsesWith(PNV);
248 PN->eraseFromParent();
254 if (isInstructionTriviallyDead(I)) {
255 for (User::op_iterator i = I->op_begin(), e = I->op_end(); i != e; ++i)
256 if (Instruction *U = dyn_cast<Instruction>(*i))
258 SE->deleteValueFromRecords(I);
259 I->eraseFromParent();
266 /// GetExpressionSCEV - Compute and return the SCEV for the specified
268 SCEVHandle LoopStrengthReduce::GetExpressionSCEV(Instruction *Exp) {
269 // Pointer to pointer bitcast instructions return the same value as their
271 if (BitCastInst *BCI = dyn_cast<BitCastInst>(Exp)) {
272 if (SE->hasSCEV(BCI) || !isa<Instruction>(BCI->getOperand(0)))
273 return SE->getSCEV(BCI);
274 SCEVHandle R = GetExpressionSCEV(cast<Instruction>(BCI->getOperand(0)));
279 // Scalar Evolutions doesn't know how to compute SCEV's for GEP instructions.
280 // If this is a GEP that SE doesn't know about, compute it now and insert it.
281 // If this is not a GEP, or if we have already done this computation, just let
283 GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Exp);
284 if (!GEP || SE->hasSCEV(GEP))
285 return SE->getSCEV(Exp);
287 // Analyze all of the subscripts of this getelementptr instruction, looking
288 // for uses that are determined by the trip count of the loop. First, skip
289 // all operands the are not dependent on the IV.
291 // Build up the base expression. Insert an LLVM cast of the pointer to
293 SCEVHandle GEPVal = SE->getUnknown(
294 getCastedVersionOf(Instruction::PtrToInt, GEP->getOperand(0)));
296 gep_type_iterator GTI = gep_type_begin(GEP);
298 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end();
299 i != e; ++i, ++GTI) {
300 // If this is a use of a recurrence that we can analyze, and it comes before
301 // Op does in the GEP operand list, we will handle this when we process this
303 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
304 const StructLayout *SL = TD->getStructLayout(STy);
305 unsigned Idx = cast<ConstantInt>(*i)->getZExtValue();
306 uint64_t Offset = SL->getElementOffset(Idx);
307 GEPVal = SE->getAddExpr(GEPVal,
308 SE->getIntegerSCEV(Offset, UIntPtrTy));
310 unsigned GEPOpiBits =
311 (*i)->getType()->getPrimitiveSizeInBits();
312 unsigned IntPtrBits = UIntPtrTy->getPrimitiveSizeInBits();
313 Instruction::CastOps opcode = (GEPOpiBits < IntPtrBits ?
314 Instruction::SExt : (GEPOpiBits > IntPtrBits ? Instruction::Trunc :
315 Instruction::BitCast));
316 Value *OpVal = getCastedVersionOf(opcode, *i);
317 SCEVHandle Idx = SE->getSCEV(OpVal);
319 uint64_t TypeSize = TD->getABITypeSize(GTI.getIndexedType());
321 Idx = SE->getMulExpr(Idx,
322 SE->getConstant(ConstantInt::get(UIntPtrTy,
324 GEPVal = SE->getAddExpr(GEPVal, Idx);
328 SE->setSCEV(GEP, GEPVal);
332 /// getSCEVStartAndStride - Compute the start and stride of this expression,
333 /// returning false if the expression is not a start/stride pair, or true if it
334 /// is. The stride must be a loop invariant expression, but the start may be
335 /// a mix of loop invariant and loop variant expressions.
336 static bool getSCEVStartAndStride(const SCEVHandle &SH, Loop *L,
337 SCEVHandle &Start, SCEVHandle &Stride,
338 ScalarEvolution *SE) {
339 SCEVHandle TheAddRec = Start; // Initialize to zero.
341 // If the outer level is an AddExpr, the operands are all start values except
342 // for a nested AddRecExpr.
343 if (SCEVAddExpr *AE = dyn_cast<SCEVAddExpr>(SH)) {
344 for (unsigned i = 0, e = AE->getNumOperands(); i != e; ++i)
345 if (SCEVAddRecExpr *AddRec =
346 dyn_cast<SCEVAddRecExpr>(AE->getOperand(i))) {
347 if (AddRec->getLoop() == L)
348 TheAddRec = SE->getAddExpr(AddRec, TheAddRec);
350 return false; // Nested IV of some sort?
352 Start = SE->getAddExpr(Start, AE->getOperand(i));
355 } else if (isa<SCEVAddRecExpr>(SH)) {
358 return false; // not analyzable.
361 SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(TheAddRec);
362 if (!AddRec || AddRec->getLoop() != L) return false;
364 // FIXME: Generalize to non-affine IV's.
365 if (!AddRec->isAffine()) return false;
367 Start = SE->getAddExpr(Start, AddRec->getOperand(0));
369 if (!isa<SCEVConstant>(AddRec->getOperand(1)))
370 DOUT << "[" << L->getHeader()->getName()
371 << "] Variable stride: " << *AddRec << "\n";
373 Stride = AddRec->getOperand(1);
377 /// IVUseShouldUsePostIncValue - We have discovered a "User" of an IV expression
378 /// and now we need to decide whether the user should use the preinc or post-inc
379 /// value. If this user should use the post-inc version of the IV, return true.
381 /// Choosing wrong here can break dominance properties (if we choose to use the
382 /// post-inc value when we cannot) or it can end up adding extra live-ranges to
383 /// the loop, resulting in reg-reg copies (if we use the pre-inc value when we
384 /// should use the post-inc value).
385 static bool IVUseShouldUsePostIncValue(Instruction *User, Instruction *IV,
386 Loop *L, DominatorTree *DT, Pass *P,
387 SetVector<Instruction*> &DeadInsts){
388 // If the user is in the loop, use the preinc value.
389 if (L->contains(User->getParent())) return false;
391 BasicBlock *LatchBlock = L->getLoopLatch();
393 // Ok, the user is outside of the loop. If it is dominated by the latch
394 // block, use the post-inc value.
395 if (DT->dominates(LatchBlock, User->getParent()))
398 // There is one case we have to be careful of: PHI nodes. These little guys
399 // can live in blocks that do not dominate the latch block, but (since their
400 // uses occur in the predecessor block, not the block the PHI lives in) should
401 // still use the post-inc value. Check for this case now.
402 PHINode *PN = dyn_cast<PHINode>(User);
403 if (!PN) return false; // not a phi, not dominated by latch block.
405 // Look at all of the uses of IV by the PHI node. If any use corresponds to
406 // a block that is not dominated by the latch block, give up and use the
407 // preincremented value.
408 unsigned NumUses = 0;
409 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
410 if (PN->getIncomingValue(i) == IV) {
412 if (!DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
416 // Okay, all uses of IV by PN are in predecessor blocks that really are
417 // dominated by the latch block. Split the critical edges and use the
418 // post-incremented value.
419 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
420 if (PN->getIncomingValue(i) == IV) {
421 SplitCriticalEdge(PN->getIncomingBlock(i), PN->getParent(), P, false);
422 // Splitting the critical edge can reduce the number of entries in this
424 e = PN->getNumIncomingValues();
425 if (--NumUses == 0) break;
428 // PHI node might have become a constant value after SplitCriticalEdge.
429 DeadInsts.insert(User);
436 /// AddUsersIfInteresting - Inspect the specified instruction. If it is a
437 /// reducible SCEV, recursively add its users to the IVUsesByStride set and
438 /// return true. Otherwise, return false.
439 bool LoopStrengthReduce::AddUsersIfInteresting(Instruction *I, Loop *L,
440 SmallPtrSet<Instruction*,16> &Processed) {
441 if (!I->getType()->isInteger() && !isa<PointerType>(I->getType()))
442 return false; // Void and FP expressions cannot be reduced.
443 if (!Processed.insert(I))
444 return true; // Instruction already handled.
446 // Get the symbolic expression for this instruction.
447 SCEVHandle ISE = GetExpressionSCEV(I);
448 if (isa<SCEVCouldNotCompute>(ISE)) return false;
450 // Get the start and stride for this expression.
451 SCEVHandle Start = SE->getIntegerSCEV(0, ISE->getType());
452 SCEVHandle Stride = Start;
453 if (!getSCEVStartAndStride(ISE, L, Start, Stride, SE))
454 return false; // Non-reducible symbolic expression, bail out.
456 std::vector<Instruction *> IUsers;
457 // Collect all I uses now because IVUseShouldUsePostIncValue may
458 // invalidate use_iterator.
459 for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI)
460 IUsers.push_back(cast<Instruction>(*UI));
462 for (unsigned iused_index = 0, iused_size = IUsers.size();
463 iused_index != iused_size; ++iused_index) {
465 Instruction *User = IUsers[iused_index];
467 // Do not infinitely recurse on PHI nodes.
468 if (isa<PHINode>(User) && Processed.count(User))
471 // If this is an instruction defined in a nested loop, or outside this loop,
472 // don't recurse into it.
473 bool AddUserToIVUsers = false;
474 if (LI->getLoopFor(User->getParent()) != L) {
475 DOUT << "FOUND USER in other loop: " << *User
476 << " OF SCEV: " << *ISE << "\n";
477 AddUserToIVUsers = true;
478 } else if (!AddUsersIfInteresting(User, L, Processed)) {
479 DOUT << "FOUND USER: " << *User
480 << " OF SCEV: " << *ISE << "\n";
481 AddUserToIVUsers = true;
484 if (AddUserToIVUsers) {
485 IVUsersOfOneStride &StrideUses = IVUsesByStride[Stride];
486 if (StrideUses.Users.empty()) // First occurance of this stride?
487 StrideOrder.push_back(Stride);
489 // Okay, we found a user that we cannot reduce. Analyze the instruction
490 // and decide what to do with it. If we are a use inside of the loop, use
491 // the value before incrementation, otherwise use it after incrementation.
492 if (IVUseShouldUsePostIncValue(User, I, L, DT, this, DeadInsts)) {
493 // The value used will be incremented by the stride more than we are
494 // expecting, so subtract this off.
495 SCEVHandle NewStart = SE->getMinusSCEV(Start, Stride);
496 StrideUses.addUser(NewStart, User, I);
497 StrideUses.Users.back().isUseOfPostIncrementedValue = true;
498 DOUT << " USING POSTINC SCEV, START=" << *NewStart<< "\n";
500 StrideUses.addUser(Start, User, I);
508 /// BasedUser - For a particular base value, keep information about how we've
509 /// partitioned the expression so far.
511 /// SE - The current ScalarEvolution object.
514 /// Base - The Base value for the PHI node that needs to be inserted for
515 /// this use. As the use is processed, information gets moved from this
516 /// field to the Imm field (below). BasedUser values are sorted by this
520 /// Inst - The instruction using the induction variable.
523 /// OperandValToReplace - The operand value of Inst to replace with the
525 Value *OperandValToReplace;
527 /// Imm - The immediate value that should be added to the base immediately
528 /// before Inst, because it will be folded into the imm field of the
532 /// EmittedBase - The actual value* to use for the base value of this
533 /// operation. This is null if we should just use zero so far.
536 // isUseOfPostIncrementedValue - True if this should use the
537 // post-incremented version of this IV, not the preincremented version.
538 // This can only be set in special cases, such as the terminating setcc
539 // instruction for a loop and uses outside the loop that are dominated by
541 bool isUseOfPostIncrementedValue;
543 BasedUser(IVStrideUse &IVSU, ScalarEvolution *se)
544 : SE(se), Base(IVSU.Offset), Inst(IVSU.User),
545 OperandValToReplace(IVSU.OperandValToReplace),
546 Imm(SE->getIntegerSCEV(0, Base->getType())), EmittedBase(0),
547 isUseOfPostIncrementedValue(IVSU.isUseOfPostIncrementedValue) {}
549 // Once we rewrite the code to insert the new IVs we want, update the
550 // operands of Inst to use the new expression 'NewBase', with 'Imm' added
552 void RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
553 Instruction *InsertPt,
554 SCEVExpander &Rewriter, Loop *L, Pass *P,
555 SetVector<Instruction*> &DeadInsts);
557 Value *InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
558 SCEVExpander &Rewriter,
559 Instruction *IP, Loop *L);
564 void BasedUser::dump() const {
565 cerr << " Base=" << *Base;
566 cerr << " Imm=" << *Imm;
568 cerr << " EB=" << *EmittedBase;
570 cerr << " Inst: " << *Inst;
573 Value *BasedUser::InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
574 SCEVExpander &Rewriter,
575 Instruction *IP, Loop *L) {
576 // Figure out where we *really* want to insert this code. In particular, if
577 // the user is inside of a loop that is nested inside of L, we really don't
578 // want to insert this expression before the user, we'd rather pull it out as
579 // many loops as possible.
580 LoopInfo &LI = Rewriter.getLoopInfo();
581 Instruction *BaseInsertPt = IP;
583 // Figure out the most-nested loop that IP is in.
584 Loop *InsertLoop = LI.getLoopFor(IP->getParent());
586 // If InsertLoop is not L, and InsertLoop is nested inside of L, figure out
587 // the preheader of the outer-most loop where NewBase is not loop invariant.
588 while (InsertLoop && NewBase->isLoopInvariant(InsertLoop)) {
589 BaseInsertPt = InsertLoop->getLoopPreheader()->getTerminator();
590 InsertLoop = InsertLoop->getParentLoop();
593 // If there is no immediate value, skip the next part.
595 return Rewriter.expandCodeFor(NewBase, BaseInsertPt);
597 Value *Base = Rewriter.expandCodeFor(NewBase, BaseInsertPt);
599 // If we are inserting the base and imm values in the same block, make sure to
600 // adjust the IP position if insertion reused a result.
601 if (IP == BaseInsertPt)
602 IP = Rewriter.getInsertionPoint();
604 // Always emit the immediate (if non-zero) into the same block as the user.
605 SCEVHandle NewValSCEV = SE->getAddExpr(SE->getUnknown(Base), Imm);
606 return Rewriter.expandCodeFor(NewValSCEV, IP);
611 // Once we rewrite the code to insert the new IVs we want, update the
612 // operands of Inst to use the new expression 'NewBase', with 'Imm' added
613 // to it. NewBasePt is the last instruction which contributes to the
614 // value of NewBase in the case that it's a diffferent instruction from
615 // the PHI that NewBase is computed from, or null otherwise.
617 void BasedUser::RewriteInstructionToUseNewBase(const SCEVHandle &NewBase,
618 Instruction *NewBasePt,
619 SCEVExpander &Rewriter, Loop *L, Pass *P,
620 SetVector<Instruction*> &DeadInsts) {
621 if (!isa<PHINode>(Inst)) {
622 // By default, insert code at the user instruction.
623 BasicBlock::iterator InsertPt = Inst;
625 // However, if the Operand is itself an instruction, the (potentially
626 // complex) inserted code may be shared by many users. Because of this, we
627 // want to emit code for the computation of the operand right before its old
628 // computation. This is usually safe, because we obviously used to use the
629 // computation when it was computed in its current block. However, in some
630 // cases (e.g. use of a post-incremented induction variable) the NewBase
631 // value will be pinned to live somewhere after the original computation.
632 // In this case, we have to back off.
633 if (!isUseOfPostIncrementedValue) {
634 if (NewBasePt && isa<PHINode>(OperandValToReplace)) {
635 InsertPt = NewBasePt;
637 } else if (Instruction *OpInst
638 = dyn_cast<Instruction>(OperandValToReplace)) {
640 while (isa<PHINode>(InsertPt)) ++InsertPt;
643 Value *NewVal = InsertCodeForBaseAtPosition(NewBase, Rewriter, InsertPt, L);
644 // Adjust the type back to match the Inst. Note that we can't use InsertPt
645 // here because the SCEVExpander may have inserted the instructions after
646 // that point, in its efforts to avoid inserting redundant expressions.
647 if (isa<PointerType>(OperandValToReplace->getType())) {
648 NewVal = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr,
650 OperandValToReplace->getType());
652 // Replace the use of the operand Value with the new Phi we just created.
653 Inst->replaceUsesOfWith(OperandValToReplace, NewVal);
654 DOUT << " CHANGED: IMM =" << *Imm;
655 DOUT << " \tNEWBASE =" << *NewBase;
656 DOUT << " \tInst = " << *Inst;
660 // PHI nodes are more complex. We have to insert one copy of the NewBase+Imm
661 // expression into each operand block that uses it. Note that PHI nodes can
662 // have multiple entries for the same predecessor. We use a map to make sure
663 // that a PHI node only has a single Value* for each predecessor (which also
664 // prevents us from inserting duplicate code in some blocks).
665 DenseMap<BasicBlock*, Value*> InsertedCode;
666 PHINode *PN = cast<PHINode>(Inst);
667 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
668 if (PN->getIncomingValue(i) == OperandValToReplace) {
669 // If this is a critical edge, split the edge so that we do not insert the
670 // code on all predecessor/successor paths. We do this unless this is the
671 // canonical backedge for this loop, as this can make some inserted code
672 // be in an illegal position.
673 BasicBlock *PHIPred = PN->getIncomingBlock(i);
674 if (e != 1 && PHIPred->getTerminator()->getNumSuccessors() > 1 &&
675 (PN->getParent() != L->getHeader() || !L->contains(PHIPred))) {
677 // First step, split the critical edge.
678 SplitCriticalEdge(PHIPred, PN->getParent(), P, false);
680 // Next step: move the basic block. In particular, if the PHI node
681 // is outside of the loop, and PredTI is in the loop, we want to
682 // move the block to be immediately before the PHI block, not
683 // immediately after PredTI.
684 if (L->contains(PHIPred) && !L->contains(PN->getParent())) {
685 BasicBlock *NewBB = PN->getIncomingBlock(i);
686 NewBB->moveBefore(PN->getParent());
689 // Splitting the edge can reduce the number of PHI entries we have.
690 e = PN->getNumIncomingValues();
693 Value *&Code = InsertedCode[PN->getIncomingBlock(i)];
695 // Insert the code into the end of the predecessor block.
696 Instruction *InsertPt = PN->getIncomingBlock(i)->getTerminator();
697 Code = InsertCodeForBaseAtPosition(NewBase, Rewriter, InsertPt, L);
699 // Adjust the type back to match the PHI. Note that we can't use
700 // InsertPt here because the SCEVExpander may have inserted its
701 // instructions after that point, in its efforts to avoid inserting
702 // redundant expressions.
703 if (isa<PointerType>(PN->getType())) {
704 Code = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr,
710 // Replace the use of the operand Value with the new Phi we just created.
711 PN->setIncomingValue(i, Code);
716 // PHI node might have become a constant value after SplitCriticalEdge.
717 DeadInsts.insert(Inst);
719 DOUT << " CHANGED: IMM =" << *Imm << " Inst = " << *Inst;
723 /// isTargetConstant - Return true if the following can be referenced by the
724 /// immediate field of a target instruction.
725 static bool isTargetConstant(const SCEVHandle &V, const Type *UseTy,
726 const TargetLowering *TLI) {
727 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(V)) {
728 int64_t VC = SC->getValue()->getSExtValue();
730 TargetLowering::AddrMode AM;
732 return TLI->isLegalAddressingMode(AM, UseTy);
734 // Defaults to PPC. PPC allows a sign-extended 16-bit immediate field.
735 return (VC > -(1 << 16) && VC < (1 << 16)-1);
739 if (SCEVUnknown *SU = dyn_cast<SCEVUnknown>(V))
740 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(SU->getValue()))
741 if (TLI && CE->getOpcode() == Instruction::PtrToInt) {
742 Constant *Op0 = CE->getOperand(0);
743 if (GlobalValue *GV = dyn_cast<GlobalValue>(Op0)) {
744 TargetLowering::AddrMode AM;
746 return TLI->isLegalAddressingMode(AM, UseTy);
752 /// MoveLoopVariantsToImediateField - Move any subexpressions from Val that are
753 /// loop varying to the Imm operand.
754 static void MoveLoopVariantsToImediateField(SCEVHandle &Val, SCEVHandle &Imm,
755 Loop *L, ScalarEvolution *SE) {
756 if (Val->isLoopInvariant(L)) return; // Nothing to do.
758 if (SCEVAddExpr *SAE = dyn_cast<SCEVAddExpr>(Val)) {
759 std::vector<SCEVHandle> NewOps;
760 NewOps.reserve(SAE->getNumOperands());
762 for (unsigned i = 0; i != SAE->getNumOperands(); ++i)
763 if (!SAE->getOperand(i)->isLoopInvariant(L)) {
764 // If this is a loop-variant expression, it must stay in the immediate
765 // field of the expression.
766 Imm = SE->getAddExpr(Imm, SAE->getOperand(i));
768 NewOps.push_back(SAE->getOperand(i));
772 Val = SE->getIntegerSCEV(0, Val->getType());
774 Val = SE->getAddExpr(NewOps);
775 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Val)) {
776 // Try to pull immediates out of the start value of nested addrec's.
777 SCEVHandle Start = SARE->getStart();
778 MoveLoopVariantsToImediateField(Start, Imm, L, SE);
780 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
782 Val = SE->getAddRecExpr(Ops, SARE->getLoop());
784 // Otherwise, all of Val is variant, move the whole thing over.
785 Imm = SE->getAddExpr(Imm, Val);
786 Val = SE->getIntegerSCEV(0, Val->getType());
791 /// MoveImmediateValues - Look at Val, and pull out any additions of constants
792 /// that can fit into the immediate field of instructions in the target.
793 /// Accumulate these immediate values into the Imm value.
794 static void MoveImmediateValues(const TargetLowering *TLI,
796 SCEVHandle &Val, SCEVHandle &Imm,
797 bool isAddress, Loop *L,
798 ScalarEvolution *SE) {
799 const Type *UseTy = User->getType();
800 if (StoreInst *SI = dyn_cast<StoreInst>(User))
801 UseTy = SI->getOperand(0)->getType();
803 if (SCEVAddExpr *SAE = dyn_cast<SCEVAddExpr>(Val)) {
804 std::vector<SCEVHandle> NewOps;
805 NewOps.reserve(SAE->getNumOperands());
807 for (unsigned i = 0; i != SAE->getNumOperands(); ++i) {
808 SCEVHandle NewOp = SAE->getOperand(i);
809 MoveImmediateValues(TLI, User, NewOp, Imm, isAddress, L, SE);
811 if (!NewOp->isLoopInvariant(L)) {
812 // If this is a loop-variant expression, it must stay in the immediate
813 // field of the expression.
814 Imm = SE->getAddExpr(Imm, NewOp);
816 NewOps.push_back(NewOp);
821 Val = SE->getIntegerSCEV(0, Val->getType());
823 Val = SE->getAddExpr(NewOps);
825 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Val)) {
826 // Try to pull immediates out of the start value of nested addrec's.
827 SCEVHandle Start = SARE->getStart();
828 MoveImmediateValues(TLI, User, Start, Imm, isAddress, L, SE);
830 if (Start != SARE->getStart()) {
831 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
833 Val = SE->getAddRecExpr(Ops, SARE->getLoop());
836 } else if (SCEVMulExpr *SME = dyn_cast<SCEVMulExpr>(Val)) {
837 // Transform "8 * (4 + v)" -> "32 + 8*V" if "32" fits in the immed field.
838 if (isAddress && isTargetConstant(SME->getOperand(0), UseTy, TLI) &&
839 SME->getNumOperands() == 2 && SME->isLoopInvariant(L)) {
841 SCEVHandle SubImm = SE->getIntegerSCEV(0, Val->getType());
842 SCEVHandle NewOp = SME->getOperand(1);
843 MoveImmediateValues(TLI, User, NewOp, SubImm, isAddress, L, SE);
845 // If we extracted something out of the subexpressions, see if we can
847 if (NewOp != SME->getOperand(1)) {
848 // Scale SubImm up by "8". If the result is a target constant, we are
850 SubImm = SE->getMulExpr(SubImm, SME->getOperand(0));
851 if (isTargetConstant(SubImm, UseTy, TLI)) {
852 // Accumulate the immediate.
853 Imm = SE->getAddExpr(Imm, SubImm);
855 // Update what is left of 'Val'.
856 Val = SE->getMulExpr(SME->getOperand(0), NewOp);
863 // Loop-variant expressions must stay in the immediate field of the
865 if ((isAddress && isTargetConstant(Val, UseTy, TLI)) ||
866 !Val->isLoopInvariant(L)) {
867 Imm = SE->getAddExpr(Imm, Val);
868 Val = SE->getIntegerSCEV(0, Val->getType());
872 // Otherwise, no immediates to move.
876 /// SeparateSubExprs - Decompose Expr into all of the subexpressions that are
877 /// added together. This is used to reassociate common addition subexprs
878 /// together for maximal sharing when rewriting bases.
879 static void SeparateSubExprs(std::vector<SCEVHandle> &SubExprs,
881 ScalarEvolution *SE) {
882 if (SCEVAddExpr *AE = dyn_cast<SCEVAddExpr>(Expr)) {
883 for (unsigned j = 0, e = AE->getNumOperands(); j != e; ++j)
884 SeparateSubExprs(SubExprs, AE->getOperand(j), SE);
885 } else if (SCEVAddRecExpr *SARE = dyn_cast<SCEVAddRecExpr>(Expr)) {
886 SCEVHandle Zero = SE->getIntegerSCEV(0, Expr->getType());
887 if (SARE->getOperand(0) == Zero) {
888 SubExprs.push_back(Expr);
890 // Compute the addrec with zero as its base.
891 std::vector<SCEVHandle> Ops(SARE->op_begin(), SARE->op_end());
892 Ops[0] = Zero; // Start with zero base.
893 SubExprs.push_back(SE->getAddRecExpr(Ops, SARE->getLoop()));
896 SeparateSubExprs(SubExprs, SARE->getOperand(0), SE);
898 } else if (!Expr->isZero()) {
900 SubExprs.push_back(Expr);
905 /// RemoveCommonExpressionsFromUseBases - Look through all of the uses in Bases,
906 /// removing any common subexpressions from it. Anything truly common is
907 /// removed, accumulated, and returned. This looks for things like (a+b+c) and
908 /// (a+c+d) -> (a+c). The common expression is *removed* from the Bases.
910 RemoveCommonExpressionsFromUseBases(std::vector<BasedUser> &Uses,
911 ScalarEvolution *SE) {
912 unsigned NumUses = Uses.size();
914 // Only one use? Use its base, regardless of what it is!
915 SCEVHandle Zero = SE->getIntegerSCEV(0, Uses[0].Base->getType());
916 SCEVHandle Result = Zero;
918 std::swap(Result, Uses[0].Base);
922 // To find common subexpressions, count how many of Uses use each expression.
923 // If any subexpressions are used Uses.size() times, they are common.
924 std::map<SCEVHandle, unsigned> SubExpressionUseCounts;
926 // UniqueSubExprs - Keep track of all of the subexpressions we see in the
927 // order we see them.
928 std::vector<SCEVHandle> UniqueSubExprs;
930 std::vector<SCEVHandle> SubExprs;
931 for (unsigned i = 0; i != NumUses; ++i) {
932 // If the base is zero (which is common), return zero now, there are no
934 if (Uses[i].Base == Zero) return Zero;
936 // Split the expression into subexprs.
937 SeparateSubExprs(SubExprs, Uses[i].Base, SE);
938 // Add one to SubExpressionUseCounts for each subexpr present.
939 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j)
940 if (++SubExpressionUseCounts[SubExprs[j]] == 1)
941 UniqueSubExprs.push_back(SubExprs[j]);
945 // Now that we know how many times each is used, build Result. Iterate over
946 // UniqueSubexprs so that we have a stable ordering.
947 for (unsigned i = 0, e = UniqueSubExprs.size(); i != e; ++i) {
948 std::map<SCEVHandle, unsigned>::iterator I =
949 SubExpressionUseCounts.find(UniqueSubExprs[i]);
950 assert(I != SubExpressionUseCounts.end() && "Entry not found?");
951 if (I->second == NumUses) { // Found CSE!
952 Result = SE->getAddExpr(Result, I->first);
954 // Remove non-cse's from SubExpressionUseCounts.
955 SubExpressionUseCounts.erase(I);
959 // If we found no CSE's, return now.
960 if (Result == Zero) return Result;
962 // Otherwise, remove all of the CSE's we found from each of the base values.
963 for (unsigned i = 0; i != NumUses; ++i) {
964 // Split the expression into subexprs.
965 SeparateSubExprs(SubExprs, Uses[i].Base, SE);
967 // Remove any common subexpressions.
968 for (unsigned j = 0, e = SubExprs.size(); j != e; ++j)
969 if (SubExpressionUseCounts.count(SubExprs[j])) {
970 SubExprs.erase(SubExprs.begin()+j);
974 // Finally, the non-shared expressions together.
975 if (SubExprs.empty())
978 Uses[i].Base = SE->getAddExpr(SubExprs);
985 /// ValidStride - Check whether the given Scale is valid for all loads and
986 /// stores in UsersToProcess.
988 bool LoopStrengthReduce::ValidStride(bool HasBaseReg,
990 const std::vector<BasedUser>& UsersToProcess) {
994 for (unsigned i=0, e = UsersToProcess.size(); i!=e; ++i) {
995 // If this is a load or other access, pass the type of the access in.
996 const Type *AccessTy = Type::VoidTy;
997 if (StoreInst *SI = dyn_cast<StoreInst>(UsersToProcess[i].Inst))
998 AccessTy = SI->getOperand(0)->getType();
999 else if (LoadInst *LI = dyn_cast<LoadInst>(UsersToProcess[i].Inst))
1000 AccessTy = LI->getType();
1001 else if (isa<PHINode>(UsersToProcess[i].Inst))
1004 TargetLowering::AddrMode AM;
1005 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(UsersToProcess[i].Imm))
1006 AM.BaseOffs = SC->getValue()->getSExtValue();
1007 AM.HasBaseReg = HasBaseReg || !UsersToProcess[i].Base->isZero();
1010 // If load[imm+r*scale] is illegal, bail out.
1011 if (!TLI->isLegalAddressingMode(AM, AccessTy))
1017 /// RequiresTypeConversion - Returns true if converting Ty to NewTy is not
1019 bool LoopStrengthReduce::RequiresTypeConversion(const Type *Ty1,
1023 if (TLI && TLI->isTruncateFree(Ty1, Ty2))
1025 return (!Ty1->canLosslesslyBitCastTo(Ty2) &&
1026 !(isa<PointerType>(Ty2) &&
1027 Ty1->canLosslesslyBitCastTo(UIntPtrTy)) &&
1028 !(isa<PointerType>(Ty1) &&
1029 Ty2->canLosslesslyBitCastTo(UIntPtrTy)));
1032 /// CheckForIVReuse - Returns the multiple if the stride is the multiple
1033 /// of a previous stride and it is a legal value for the target addressing
1034 /// mode scale component and optional base reg. This allows the users of
1035 /// this stride to be rewritten as prev iv * factor. It returns 0 if no
1036 /// reuse is possible.
1037 unsigned LoopStrengthReduce::CheckForIVReuse(bool HasBaseReg,
1038 bool AllUsesAreAddresses,
1039 const SCEVHandle &Stride,
1040 IVExpr &IV, const Type *Ty,
1041 const std::vector<BasedUser>& UsersToProcess) {
1042 if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Stride)) {
1043 int64_t SInt = SC->getValue()->getSExtValue();
1044 for (unsigned NewStride = 0, e = StrideOrder.size(); NewStride != e;
1046 std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
1047 IVsByStride.find(StrideOrder[NewStride]);
1048 if (SI == IVsByStride.end())
1050 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
1051 if (SI->first != Stride &&
1052 (unsigned(abs(SInt)) < SSInt || (SInt % SSInt) != 0))
1054 int64_t Scale = SInt / SSInt;
1055 // Check that this stride is valid for all the types used for loads and
1056 // stores; if it can be used for some and not others, we might as well use
1057 // the original stride everywhere, since we have to create the IV for it
1058 // anyway. If the scale is 1, then we don't need to worry about folding
1061 (AllUsesAreAddresses &&
1062 ValidStride(HasBaseReg, Scale, UsersToProcess)))
1063 for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
1064 IE = SI->second.IVs.end(); II != IE; ++II)
1065 // FIXME: Only handle base == 0 for now.
1066 // Only reuse previous IV if it would not require a type conversion.
1067 if (II->Base->isZero() &&
1068 !RequiresTypeConversion(II->Base->getType(), Ty)) {
1077 /// PartitionByIsUseOfPostIncrementedValue - Simple boolean predicate that
1078 /// returns true if Val's isUseOfPostIncrementedValue is true.
1079 static bool PartitionByIsUseOfPostIncrementedValue(const BasedUser &Val) {
1080 return Val.isUseOfPostIncrementedValue;
1083 /// isNonConstantNegative - Return true if the specified scev is negated, but
1085 static bool isNonConstantNegative(const SCEVHandle &Expr) {
1086 SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(Expr);
1087 if (!Mul) return false;
1089 // If there is a constant factor, it will be first.
1090 SCEVConstant *SC = dyn_cast<SCEVConstant>(Mul->getOperand(0));
1091 if (!SC) return false;
1093 // Return true if the value is negative, this matches things like (-42 * V).
1094 return SC->getValue()->getValue().isNegative();
1097 /// isAddress - Returns true if the specified instruction is using the
1098 /// specified value as an address.
1099 static bool isAddressUse(Instruction *Inst, Value *OperandVal) {
1100 bool isAddress = isa<LoadInst>(Inst);
1101 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
1102 if (SI->getOperand(1) == OperandVal)
1104 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
1105 // Addressing modes can also be folded into prefetches and a variety
1107 switch (II->getIntrinsicID()) {
1109 case Intrinsic::prefetch:
1110 case Intrinsic::x86_sse2_loadu_dq:
1111 case Intrinsic::x86_sse2_loadu_pd:
1112 case Intrinsic::x86_sse_loadu_ps:
1113 case Intrinsic::x86_sse_storeu_ps:
1114 case Intrinsic::x86_sse2_storeu_pd:
1115 case Intrinsic::x86_sse2_storeu_dq:
1116 case Intrinsic::x86_sse2_storel_dq:
1117 if (II->getOperand(1) == OperandVal)
1125 // CollectIVUsers - Transform our list of users and offsets to a bit more
1126 // complex table. In this new vector, each 'BasedUser' contains 'Base', the base
1127 // of the strided accesses, as well as the old information from Uses. We
1128 // progressively move information from the Base field to the Imm field, until
1129 // we eventually have the full access expression to rewrite the use.
1130 SCEVHandle LoopStrengthReduce::CollectIVUsers(const SCEVHandle &Stride,
1131 IVUsersOfOneStride &Uses,
1133 bool &AllUsesAreAddresses,
1134 std::vector<BasedUser> &UsersToProcess) {
1135 UsersToProcess.reserve(Uses.Users.size());
1136 for (unsigned i = 0, e = Uses.Users.size(); i != e; ++i) {
1137 UsersToProcess.push_back(BasedUser(Uses.Users[i], SE));
1139 // Move any loop invariant operands from the offset field to the immediate
1140 // field of the use, so that we don't try to use something before it is
1142 MoveLoopVariantsToImediateField(UsersToProcess.back().Base,
1143 UsersToProcess.back().Imm, L, SE);
1144 assert(UsersToProcess.back().Base->isLoopInvariant(L) &&
1145 "Base value is not loop invariant!");
1148 // We now have a whole bunch of uses of like-strided induction variables, but
1149 // they might all have different bases. We want to emit one PHI node for this
1150 // stride which we fold as many common expressions (between the IVs) into as
1151 // possible. Start by identifying the common expressions in the base values
1152 // for the strides (e.g. if we have "A+C+B" and "A+B+D" as our bases, find
1153 // "A+B"), emit it to the preheader, then remove the expression from the
1154 // UsersToProcess base values.
1155 SCEVHandle CommonExprs =
1156 RemoveCommonExpressionsFromUseBases(UsersToProcess, SE);
1158 // Next, figure out what we can represent in the immediate fields of
1159 // instructions. If we can represent anything there, move it to the imm
1160 // fields of the BasedUsers. We do this so that it increases the commonality
1161 // of the remaining uses.
1162 unsigned NumPHI = 0;
1163 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1164 // If the user is not in the current loop, this means it is using the exit
1165 // value of the IV. Do not put anything in the base, make sure it's all in
1166 // the immediate field to allow as much factoring as possible.
1167 if (!L->contains(UsersToProcess[i].Inst->getParent())) {
1168 UsersToProcess[i].Imm = SE->getAddExpr(UsersToProcess[i].Imm,
1169 UsersToProcess[i].Base);
1170 UsersToProcess[i].Base =
1171 SE->getIntegerSCEV(0, UsersToProcess[i].Base->getType());
1174 // Addressing modes can be folded into loads and stores. Be careful that
1175 // the store is through the expression, not of the expression though.
1177 bool isAddress = isAddressUse(UsersToProcess[i].Inst,
1178 UsersToProcess[i].OperandValToReplace);
1179 if (isa<PHINode>(UsersToProcess[i].Inst)) {
1184 // If this use isn't an address, then not all uses are addresses.
1185 if (!isAddress && !isPHI)
1186 AllUsesAreAddresses = false;
1188 MoveImmediateValues(TLI, UsersToProcess[i].Inst, UsersToProcess[i].Base,
1189 UsersToProcess[i].Imm, isAddress, L, SE);
1193 // If one of the use if a PHI node and all other uses are addresses, still
1194 // allow iv reuse. Essentially we are trading one constant multiplication
1195 // for one fewer iv.
1197 AllUsesAreAddresses = false;
1202 /// StrengthReduceStridedIVUsers - Strength reduce all of the users of a single
1203 /// stride of IV. All of the users may have different starting values, and this
1204 /// may not be the only stride (we know it is if isOnlyStride is true).
1205 void LoopStrengthReduce::StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
1206 IVUsersOfOneStride &Uses,
1208 bool isOnlyStride) {
1209 // If all the users are moved to another stride, then there is nothing to do.
1210 if (Uses.Users.empty())
1213 // Keep track if every use in UsersToProcess is an address. If they all are,
1214 // we may be able to rewrite the entire collection of them in terms of a
1215 // smaller-stride IV.
1216 bool AllUsesAreAddresses = true;
1218 // Transform our list of users and offsets to a bit more complex table. In
1219 // this new vector, each 'BasedUser' contains 'Base' the base of the
1220 // strided accessas well as the old information from Uses. We progressively
1221 // move information from the Base field to the Imm field, until we eventually
1222 // have the full access expression to rewrite the use.
1223 std::vector<BasedUser> UsersToProcess;
1224 SCEVHandle CommonExprs = CollectIVUsers(Stride, Uses, L, AllUsesAreAddresses,
1227 // If we managed to find some expressions in common, we'll need to carry
1228 // their value in a register and add it in for each use. This will take up
1229 // a register operand, which potentially restricts what stride values are
1231 bool HaveCommonExprs = !CommonExprs->isZero();
1233 // If all uses are addresses, check if it is possible to reuse an IV with a
1234 // stride that is a factor of this stride. And that the multiple is a number
1235 // that can be encoded in the scale field of the target addressing mode. And
1236 // that we will have a valid instruction after this substition, including the
1237 // immediate field, if any.
1238 PHINode *NewPHI = NULL;
1240 IVExpr ReuseIV(SE->getIntegerSCEV(0, Type::Int32Ty),
1241 SE->getIntegerSCEV(0, Type::Int32Ty),
1243 unsigned RewriteFactor = 0;
1244 RewriteFactor = CheckForIVReuse(HaveCommonExprs, AllUsesAreAddresses,
1245 Stride, ReuseIV, CommonExprs->getType(),
1247 if (RewriteFactor != 0) {
1248 DOUT << "BASED ON IV of STRIDE " << *ReuseIV.Stride
1249 << " and BASE " << *ReuseIV.Base << " :\n";
1250 NewPHI = ReuseIV.PHI;
1251 IncV = ReuseIV.IncV;
1254 const Type *ReplacedTy = CommonExprs->getType();
1256 // Now that we know what we need to do, insert the PHI node itself.
1258 DOUT << "INSERTING IV of TYPE " << *ReplacedTy << " of STRIDE "
1259 << *Stride << " and BASE " << *CommonExprs << ": ";
1261 SCEVExpander Rewriter(*SE, *LI);
1262 SCEVExpander PreheaderRewriter(*SE, *LI);
1264 BasicBlock *Preheader = L->getLoopPreheader();
1265 Instruction *PreInsertPt = Preheader->getTerminator();
1266 Instruction *PhiInsertBefore = L->getHeader()->begin();
1268 BasicBlock *LatchBlock = L->getLoopLatch();
1271 // Emit the initial base value into the loop preheader.
1273 = PreheaderRewriter.expandCodeFor(CommonExprs, PreInsertPt);
1275 if (RewriteFactor == 0) {
1276 // Create a new Phi for this base, and stick it in the loop header.
1277 NewPHI = PHINode::Create(ReplacedTy, "iv.", PhiInsertBefore);
1280 // Add common base to the new Phi node.
1281 NewPHI->addIncoming(CommonBaseV, Preheader);
1283 // If the stride is negative, insert a sub instead of an add for the
1285 bool isNegative = isNonConstantNegative(Stride);
1286 SCEVHandle IncAmount = Stride;
1288 IncAmount = SE->getNegativeSCEV(Stride);
1290 // Insert the stride into the preheader.
1291 Value *StrideV = PreheaderRewriter.expandCodeFor(IncAmount, PreInsertPt);
1292 if (!isa<ConstantInt>(StrideV)) ++NumVariable;
1294 // Emit the increment of the base value before the terminator of the loop
1295 // latch block, and add it to the Phi node.
1296 SCEVHandle IncExp = SE->getUnknown(StrideV);
1298 IncExp = SE->getNegativeSCEV(IncExp);
1299 IncExp = SE->getAddExpr(SE->getUnknown(NewPHI), IncExp);
1301 IncV = Rewriter.expandCodeFor(IncExp, LatchBlock->getTerminator());
1302 IncV->setName(NewPHI->getName()+".inc");
1303 NewPHI->addIncoming(IncV, LatchBlock);
1305 // Remember this in case a later stride is multiple of this.
1306 IVsByStride[Stride].addIV(Stride, CommonExprs, NewPHI, IncV);
1308 DOUT << " IV=%" << NewPHI->getNameStr() << " INC=%" << IncV->getNameStr();
1310 Constant *C = dyn_cast<Constant>(CommonBaseV);
1312 (!C->isNullValue() &&
1313 !isTargetConstant(SE->getUnknown(CommonBaseV), ReplacedTy, TLI)))
1314 // We want the common base emitted into the preheader! This is just
1315 // using cast as a copy so BitCast (no-op cast) is appropriate
1316 CommonBaseV = new BitCastInst(CommonBaseV, CommonBaseV->getType(),
1317 "commonbase", PreInsertPt);
1321 // We want to emit code for users inside the loop first. To do this, we
1322 // rearrange BasedUser so that the entries at the end have
1323 // isUseOfPostIncrementedValue = false, because we pop off the end of the
1324 // vector (so we handle them first).
1325 std::partition(UsersToProcess.begin(), UsersToProcess.end(),
1326 PartitionByIsUseOfPostIncrementedValue);
1328 // Sort this by base, so that things with the same base are handled
1329 // together. By partitioning first and stable-sorting later, we are
1330 // guaranteed that within each base we will pop off users from within the
1331 // loop before users outside of the loop with a particular base.
1333 // We would like to use stable_sort here, but we can't. The problem is that
1334 // SCEVHandle's don't have a deterministic ordering w.r.t to each other, so
1335 // we don't have anything to do a '<' comparison on. Because we think the
1336 // number of uses is small, do a horrible bubble sort which just relies on
1338 for (unsigned i = 0, e = UsersToProcess.size(); i != e; ++i) {
1339 // Get a base value.
1340 SCEVHandle Base = UsersToProcess[i].Base;
1342 // Compact everything with this base to be consequtive with this one.
1343 for (unsigned j = i+1; j != e; ++j) {
1344 if (UsersToProcess[j].Base == Base) {
1345 std::swap(UsersToProcess[i+1], UsersToProcess[j]);
1351 // Process all the users now. This outer loop handles all bases, the inner
1352 // loop handles all users of a particular base.
1353 while (!UsersToProcess.empty()) {
1354 SCEVHandle Base = UsersToProcess.back().Base;
1356 // Emit the code for Base into the preheader.
1357 Value *BaseV = PreheaderRewriter.expandCodeFor(Base, PreInsertPt);
1359 DOUT << " INSERTING code for BASE = " << *Base << ":";
1360 if (BaseV->hasName())
1361 DOUT << " Result value name = %" << BaseV->getNameStr();
1364 // If BaseV is a constant other than 0, make sure that it gets inserted into
1365 // the preheader, instead of being forward substituted into the uses. We do
1366 // this by forcing a BitCast (noop cast) to be inserted into the preheader
1368 if (Constant *C = dyn_cast<Constant>(BaseV)) {
1369 if (!C->isNullValue() && !isTargetConstant(Base, ReplacedTy, TLI)) {
1370 // We want this constant emitted into the preheader! This is just
1371 // using cast as a copy so BitCast (no-op cast) is appropriate
1372 BaseV = new BitCastInst(BaseV, BaseV->getType(), "preheaderinsert",
1377 // Emit the code to add the immediate offset to the Phi value, just before
1378 // the instructions that we identified as using this stride and base.
1380 // FIXME: Use emitted users to emit other users.
1381 BasedUser &User = UsersToProcess.back();
1383 // If this instruction wants to use the post-incremented value, move it
1384 // after the post-inc and use its value instead of the PHI.
1385 Value *RewriteOp = NewPHI;
1386 if (User.isUseOfPostIncrementedValue) {
1389 // If this user is in the loop, make sure it is the last thing in the
1390 // loop to ensure it is dominated by the increment.
1391 if (L->contains(User.Inst->getParent()))
1392 User.Inst->moveBefore(LatchBlock->getTerminator());
1394 if (RewriteOp->getType() != ReplacedTy) {
1395 Instruction::CastOps opcode = Instruction::Trunc;
1396 if (ReplacedTy->getPrimitiveSizeInBits() ==
1397 RewriteOp->getType()->getPrimitiveSizeInBits())
1398 opcode = Instruction::BitCast;
1399 RewriteOp = SCEVExpander::InsertCastOfTo(opcode, RewriteOp, ReplacedTy);
1402 SCEVHandle RewriteExpr = SE->getUnknown(RewriteOp);
1404 // If we had to insert new instrutions for RewriteOp, we have to
1405 // consider that they may not have been able to end up immediately
1406 // next to RewriteOp, because non-PHI instructions may never precede
1407 // PHI instructions in a block. In this case, remember where the last
1408 // instruction was inserted so that if we're replacing a different
1409 // PHI node, we can use the later point to expand the final
1411 Instruction *NewBasePt = dyn_cast<Instruction>(RewriteOp);
1412 if (RewriteOp == NewPHI) NewBasePt = 0;
1414 // Clear the SCEVExpander's expression map so that we are guaranteed
1415 // to have the code emitted where we expect it.
1418 // If we are reusing the iv, then it must be multiplied by a constant
1419 // factor take advantage of addressing mode scale component.
1420 if (RewriteFactor != 0) {
1421 RewriteExpr = SE->getMulExpr(SE->getIntegerSCEV(RewriteFactor,
1422 RewriteExpr->getType()),
1425 // The common base is emitted in the loop preheader. But since we
1426 // are reusing an IV, it has not been used to initialize the PHI node.
1427 // Add it to the expression used to rewrite the uses.
1428 if (!isa<ConstantInt>(CommonBaseV) ||
1429 !cast<ConstantInt>(CommonBaseV)->isZero())
1430 RewriteExpr = SE->getAddExpr(RewriteExpr,
1431 SE->getUnknown(CommonBaseV));
1434 // Now that we know what we need to do, insert code before User for the
1435 // immediate and any loop-variant expressions.
1436 if (!isa<ConstantInt>(BaseV) || !cast<ConstantInt>(BaseV)->isZero())
1437 // Add BaseV to the PHI value if needed.
1438 RewriteExpr = SE->getAddExpr(RewriteExpr, SE->getUnknown(BaseV));
1440 User.RewriteInstructionToUseNewBase(RewriteExpr, NewBasePt,
1444 // Mark old value we replaced as possibly dead, so that it is elminated
1445 // if we just replaced the last use of that value.
1446 DeadInsts.insert(cast<Instruction>(User.OperandValToReplace));
1448 UsersToProcess.pop_back();
1451 // If there are any more users to process with the same base, process them
1452 // now. We sorted by base above, so we just have to check the last elt.
1453 } while (!UsersToProcess.empty() && UsersToProcess.back().Base == Base);
1454 // TODO: Next, find out which base index is the most common, pull it out.
1457 // IMPORTANT TODO: Figure out how to partition the IV's with this stride, but
1458 // different starting values, into different PHIs.
1461 /// FindIVUserForCond - If Cond has an operand that is an expression of an IV,
1462 /// set the IV user and stride information and return true, otherwise return
1464 bool LoopStrengthReduce::FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse,
1465 const SCEVHandle *&CondStride) {
1466 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e && !CondUse;
1468 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
1469 IVUsesByStride.find(StrideOrder[Stride]);
1470 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
1472 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
1473 E = SI->second.Users.end(); UI != E; ++UI)
1474 if (UI->User == Cond) {
1475 // NOTE: we could handle setcc instructions with multiple uses here, but
1476 // InstCombine does it as well for simple uses, it's not clear that it
1477 // occurs enough in real life to handle.
1479 CondStride = &SI->first;
1487 // Constant strides come first which in turns are sorted by their absolute
1488 // values. If absolute values are the same, then positive strides comes first.
1490 // 4, -1, X, 1, 2 ==> 1, -1, 2, 4, X
1491 struct StrideCompare {
1492 bool operator()(const SCEVHandle &LHS, const SCEVHandle &RHS) {
1493 SCEVConstant *LHSC = dyn_cast<SCEVConstant>(LHS);
1494 SCEVConstant *RHSC = dyn_cast<SCEVConstant>(RHS);
1496 int64_t LV = LHSC->getValue()->getSExtValue();
1497 int64_t RV = RHSC->getValue()->getSExtValue();
1498 uint64_t ALV = (LV < 0) ? -LV : LV;
1499 uint64_t ARV = (RV < 0) ? -RV : RV;
1505 return (LHSC && !RHSC);
1510 /// ChangeCompareStride - If a loop termination compare instruction is the
1511 /// only use of its stride, and the compaison is against a constant value,
1512 /// try eliminate the stride by moving the compare instruction to another
1513 /// stride and change its constant operand accordingly. e.g.
1519 /// if (v2 < 10) goto loop
1524 /// if (v1 < 30) goto loop
1525 ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
1526 IVStrideUse* &CondUse,
1527 const SCEVHandle* &CondStride) {
1528 if (StrideOrder.size() < 2 ||
1529 IVUsesByStride[*CondStride].Users.size() != 1)
1531 const SCEVConstant *SC = dyn_cast<SCEVConstant>(*CondStride);
1532 if (!SC) return Cond;
1533 ConstantInt *C = dyn_cast<ConstantInt>(Cond->getOperand(1));
1534 if (!C) return Cond;
1536 ICmpInst::Predicate Predicate = Cond->getPredicate();
1537 int64_t CmpSSInt = SC->getValue()->getSExtValue();
1538 int64_t CmpVal = C->getValue().getSExtValue();
1539 unsigned BitWidth = C->getValue().getBitWidth();
1540 uint64_t SignBit = 1ULL << (BitWidth-1);
1541 const Type *CmpTy = C->getType();
1542 const Type *NewCmpTy = NULL;
1543 unsigned TyBits = CmpTy->getPrimitiveSizeInBits();
1544 unsigned NewTyBits = 0;
1545 int64_t NewCmpVal = CmpVal;
1546 SCEVHandle *NewStride = NULL;
1547 Value *NewIncV = NULL;
1550 // Check stride constant and the comparision constant signs to detect
1552 if (ICmpInst::isSignedPredicate(Predicate) &&
1553 (CmpVal & SignBit) != (CmpSSInt & SignBit))
1556 // Look for a suitable stride / iv as replacement.
1557 std::stable_sort(StrideOrder.begin(), StrideOrder.end(), StrideCompare());
1558 for (unsigned i = 0, e = StrideOrder.size(); i != e; ++i) {
1559 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
1560 IVUsesByStride.find(StrideOrder[i]);
1561 if (!isa<SCEVConstant>(SI->first))
1563 int64_t SSInt = cast<SCEVConstant>(SI->first)->getValue()->getSExtValue();
1564 if (abs(SSInt) <= abs(CmpSSInt) || (SSInt % CmpSSInt) != 0)
1567 Scale = SSInt / CmpSSInt;
1568 NewCmpVal = CmpVal * Scale;
1569 APInt Mul = APInt(BitWidth, NewCmpVal);
1570 // Check for overflow.
1571 if (Mul.getSExtValue() != NewCmpVal) {
1576 // Watch out for overflow.
1577 if (ICmpInst::isSignedPredicate(Predicate) &&
1578 (CmpVal & SignBit) != (NewCmpVal & SignBit))
1581 if (NewCmpVal != CmpVal) {
1582 // Pick the best iv to use trying to avoid a cast.
1584 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
1585 E = SI->second.Users.end(); UI != E; ++UI) {
1586 NewIncV = UI->OperandValToReplace;
1587 if (NewIncV->getType() == CmpTy)
1595 NewCmpTy = NewIncV->getType();
1596 NewTyBits = isa<PointerType>(NewCmpTy)
1597 ? UIntPtrTy->getPrimitiveSizeInBits()
1598 : NewCmpTy->getPrimitiveSizeInBits();
1599 if (RequiresTypeConversion(NewCmpTy, CmpTy)) {
1600 // Check if it is possible to rewrite it using
1601 // an iv / stride of a smaller integer type.
1602 bool TruncOk = false;
1603 if (NewCmpTy->isInteger()) {
1604 unsigned Bits = NewTyBits;
1605 if (ICmpInst::isSignedPredicate(Predicate))
1607 uint64_t Mask = (1ULL << Bits) - 1;
1608 if (((uint64_t)NewCmpVal & Mask) == (uint64_t)NewCmpVal)
1617 // Don't rewrite if use offset is non-constant and the new type is
1618 // of a different type.
1619 // FIXME: too conservative?
1620 if (NewTyBits != TyBits && !isa<SCEVConstant>(CondUse->Offset)) {
1625 bool AllUsesAreAddresses = true;
1626 std::vector<BasedUser> UsersToProcess;
1627 SCEVHandle CommonExprs = CollectIVUsers(SI->first, SI->second, L,
1628 AllUsesAreAddresses,
1630 // Avoid rewriting the compare instruction with an iv of new stride
1631 // if it's likely the new stride uses will be rewritten using the
1632 if (AllUsesAreAddresses &&
1633 ValidStride(!CommonExprs->isZero(), Scale, UsersToProcess)) {
1638 // If scale is negative, use swapped predicate unless it's testing
1640 if (Scale < 0 && !Cond->isEquality())
1641 Predicate = ICmpInst::getSwappedPredicate(Predicate);
1643 NewStride = &StrideOrder[i];
1648 // Forgo this transformation if it the increment happens to be
1649 // unfortunately positioned after the condition, and the condition
1650 // has multiple uses which prevent it from being moved immediately
1651 // before the branch. See
1652 // test/Transforms/LoopStrengthReduce/change-compare-stride-trickiness-*.ll
1653 // for an example of this situation.
1654 if (!Cond->hasOneUse()) {
1655 for (BasicBlock::iterator I = Cond, E = Cond->getParent()->end();
1661 if (NewCmpVal != CmpVal) {
1662 // Create a new compare instruction using new stride / iv.
1663 ICmpInst *OldCond = Cond;
1665 if (!isa<PointerType>(NewCmpTy))
1666 RHS = ConstantInt::get(NewCmpTy, NewCmpVal);
1668 RHS = ConstantInt::get(UIntPtrTy, NewCmpVal);
1669 RHS = SCEVExpander::InsertCastOfTo(Instruction::IntToPtr, RHS, NewCmpTy);
1671 // Insert new compare instruction.
1672 Cond = new ICmpInst(Predicate, NewIncV, RHS,
1673 L->getHeader()->getName() + ".termcond",
1676 // Remove the old compare instruction. The old indvar is probably dead too.
1677 DeadInsts.insert(cast<Instruction>(CondUse->OperandValToReplace));
1678 SE->deleteValueFromRecords(OldCond);
1679 OldCond->replaceAllUsesWith(Cond);
1680 OldCond->eraseFromParent();
1682 IVUsesByStride[*CondStride].Users.pop_back();
1683 SCEVHandle NewOffset = TyBits == NewTyBits
1684 ? SE->getMulExpr(CondUse->Offset,
1685 SE->getConstant(ConstantInt::get(CmpTy, Scale)))
1686 : SE->getConstant(ConstantInt::get(NewCmpTy,
1687 cast<SCEVConstant>(CondUse->Offset)->getValue()->getSExtValue()*Scale));
1688 IVUsesByStride[*NewStride].addUser(NewOffset, Cond, NewIncV);
1689 CondUse = &IVUsesByStride[*NewStride].Users.back();
1690 CondStride = NewStride;
1697 /// OptimizeShadowIV - If IV is used in a int-to-float cast
1698 /// inside the loop then try to eliminate the cast opeation.
1699 void LoopStrengthReduce::OptimizeShadowIV(Loop *L) {
1701 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e;
1703 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
1704 IVUsesByStride.find(StrideOrder[Stride]);
1705 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
1707 for (std::vector<IVStrideUse>::iterator UI = SI->second.Users.begin(),
1708 E = SI->second.Users.end(); UI != E; /* empty */) {
1709 std::vector<IVStrideUse>::iterator CandidateUI = UI;
1711 Instruction *ShadowUse = CandidateUI->User;
1712 const Type *DestTy = NULL;
1714 /* If shadow use is a int->float cast then insert a second IV
1715 to elminate this cast.
1717 for (unsigned i = 0; i < n; ++i)
1723 for (unsigned i = 0; i < n; ++i, ++d)
1726 UIToFPInst *UCast = dyn_cast<UIToFPInst>(CandidateUI->User);
1728 DestTy = UCast->getDestTy();
1730 SIToFPInst *SCast = dyn_cast<SIToFPInst>(CandidateUI->User);
1731 if (!SCast) continue;
1732 DestTy = SCast->getDestTy();
1735 PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0));
1737 if (PH->getNumIncomingValues() != 2) continue;
1739 unsigned Entry, Latch;
1740 if (PH->getIncomingBlock(0) == L->getLoopPreheader()) {
1748 ConstantInt *Init = dyn_cast<ConstantInt>(PH->getIncomingValue(Entry));
1749 if (!Init) continue;
1750 ConstantFP *NewInit = ConstantFP::get(DestTy, Init->getZExtValue());
1752 BinaryOperator *Incr =
1753 dyn_cast<BinaryOperator>(PH->getIncomingValue(Latch));
1754 if (!Incr) continue;
1755 if (Incr->getOpcode() != Instruction::Add
1756 && Incr->getOpcode() != Instruction::Sub)
1759 /* Initialize new IV, double d = 0.0 in above example. */
1760 ConstantInt *C = NULL;
1761 if (Incr->getOperand(0) == PH)
1762 C = dyn_cast<ConstantInt>(Incr->getOperand(1));
1763 else if (Incr->getOperand(1) == PH)
1764 C = dyn_cast<ConstantInt>(Incr->getOperand(0));
1770 /* create new icnrement. '++d' in above example. */
1771 ConstantFP *CFP = ConstantFP::get(DestTy, C->getZExtValue());
1772 BinaryOperator *NewIncr =
1773 BinaryOperator::Create(Incr->getOpcode(),
1774 NewInit, CFP, "IV.S.next.", Incr);
1776 /* Add new PHINode. */
1777 PHINode *NewPH = PHINode::Create(DestTy, "IV.S.", PH);
1778 NewPH->addIncoming(NewInit, PH->getIncomingBlock(Entry));
1779 NewPH->addIncoming(NewIncr, PH->getIncomingBlock(Latch));
1781 /* Remove cast operation */
1782 ShadowUse->replaceAllUsesWith(NewPH);
1783 ShadowUse->eraseFromParent();
1784 SI->second.Users.erase(CandidateUI);
1791 // OptimizeIndvars - Now that IVUsesByStride is set up with all of the indvar
1792 // uses in the loop, look to see if we can eliminate some, in favor of using
1793 // common indvars for the different uses.
1794 void LoopStrengthReduce::OptimizeIndvars(Loop *L) {
1795 // TODO: implement optzns here.
1797 OptimizeShadowIV(L);
1799 // Finally, get the terminating condition for the loop if possible. If we
1800 // can, we want to change it to use a post-incremented version of its
1801 // induction variable, to allow coalescing the live ranges for the IV into
1802 // one register value.
1803 PHINode *SomePHI = cast<PHINode>(L->getHeader()->begin());
1804 BasicBlock *Preheader = L->getLoopPreheader();
1805 BasicBlock *LatchBlock =
1806 SomePHI->getIncomingBlock(SomePHI->getIncomingBlock(0) == Preheader);
1807 BranchInst *TermBr = dyn_cast<BranchInst>(LatchBlock->getTerminator());
1808 if (!TermBr || TermBr->isUnconditional() ||
1809 !isa<ICmpInst>(TermBr->getCondition()))
1811 ICmpInst *Cond = cast<ICmpInst>(TermBr->getCondition());
1813 // Search IVUsesByStride to find Cond's IVUse if there is one.
1814 IVStrideUse *CondUse = 0;
1815 const SCEVHandle *CondStride = 0;
1817 if (!FindIVUserForCond(Cond, CondUse, CondStride))
1818 return; // setcc doesn't use the IV.
1820 // If possible, change stride and operands of the compare instruction to
1821 // eliminate one stride.
1822 Cond = ChangeCompareStride(L, Cond, CondUse, CondStride);
1824 // It's possible for the setcc instruction to be anywhere in the loop, and
1825 // possible for it to have multiple users. If it is not immediately before
1826 // the latch block branch, move it.
1827 if (&*++BasicBlock::iterator(Cond) != (Instruction*)TermBr) {
1828 if (Cond->hasOneUse()) { // Condition has a single use, just move it.
1829 Cond->moveBefore(TermBr);
1831 // Otherwise, clone the terminating condition and insert into the loopend.
1832 Cond = cast<ICmpInst>(Cond->clone());
1833 Cond->setName(L->getHeader()->getName() + ".termcond");
1834 LatchBlock->getInstList().insert(TermBr, Cond);
1836 // Clone the IVUse, as the old use still exists!
1837 IVUsesByStride[*CondStride].addUser(CondUse->Offset, Cond,
1838 CondUse->OperandValToReplace);
1839 CondUse = &IVUsesByStride[*CondStride].Users.back();
1843 // If we get to here, we know that we can transform the setcc instruction to
1844 // use the post-incremented version of the IV, allowing us to coalesce the
1845 // live ranges for the IV correctly.
1846 CondUse->Offset = SE->getMinusSCEV(CondUse->Offset, *CondStride);
1847 CondUse->isUseOfPostIncrementedValue = true;
1851 bool LoopStrengthReduce::runOnLoop(Loop *L, LPPassManager &LPM) {
1853 LI = &getAnalysis<LoopInfo>();
1854 DT = &getAnalysis<DominatorTree>();
1855 SE = &getAnalysis<ScalarEvolution>();
1856 TD = &getAnalysis<TargetData>();
1857 UIntPtrTy = TD->getIntPtrType();
1860 // Find all uses of induction variables in this loop, and catagorize
1861 // them by stride. Start by finding all of the PHI nodes in the header for
1862 // this loop. If they are induction variables, inspect their uses.
1863 SmallPtrSet<Instruction*,16> Processed; // Don't reprocess instructions.
1864 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I)
1865 AddUsersIfInteresting(I, L, Processed);
1867 if (!IVUsesByStride.empty()) {
1868 // Optimize induction variables. Some indvar uses can be transformed to use
1869 // strides that will be needed for other purposes. A common example of this
1870 // is the exit test for the loop, which can often be rewritten to use the
1871 // computation of some other indvar to decide when to terminate the loop.
1874 // FIXME: We can widen subreg IV's here for RISC targets. e.g. instead of
1875 // doing computation in byte values, promote to 32-bit values if safe.
1877 // FIXME: Attempt to reuse values across multiple IV's. In particular, we
1878 // could have something like "for(i) { foo(i*8); bar(i*16) }", which should
1879 // be codegened as "for (j = 0;; j+=8) { foo(j); bar(j+j); }" on X86/PPC.
1880 // Need to be careful that IV's are all the same type. Only works for
1881 // intptr_t indvars.
1883 // If we only have one stride, we can more aggressively eliminate some
1885 bool HasOneStride = IVUsesByStride.size() == 1;
1888 DOUT << "\nLSR on ";
1892 // IVsByStride keeps IVs for one particular loop.
1893 assert(IVsByStride.empty() && "Stale entries in IVsByStride?");
1895 // Sort the StrideOrder so we process larger strides first.
1896 std::stable_sort(StrideOrder.begin(), StrideOrder.end(), StrideCompare());
1898 // Note: this processes each stride/type pair individually. All users
1899 // passed into StrengthReduceStridedIVUsers have the same type AND stride.
1900 // Also, note that we iterate over IVUsesByStride indirectly by using
1901 // StrideOrder. This extra layer of indirection makes the ordering of
1902 // strides deterministic - not dependent on map order.
1903 for (unsigned Stride = 0, e = StrideOrder.size(); Stride != e; ++Stride) {
1904 std::map<SCEVHandle, IVUsersOfOneStride>::iterator SI =
1905 IVUsesByStride.find(StrideOrder[Stride]);
1906 assert(SI != IVUsesByStride.end() && "Stride doesn't exist!");
1907 StrengthReduceStridedIVUsers(SI->first, SI->second, L, HasOneStride);
1911 // We're done analyzing this loop; release all the state we built up for it.
1912 CastedPointers.clear();
1913 IVUsesByStride.clear();
1914 IVsByStride.clear();
1915 StrideOrder.clear();
1917 // Clean up after ourselves
1918 if (!DeadInsts.empty()) {
1919 DeleteTriviallyDeadInstructions(DeadInsts);
1921 BasicBlock::iterator I = L->getHeader()->begin();
1922 while (PHINode *PN = dyn_cast<PHINode>(I++)) {
1923 // At this point, we know that we have killed one or more IV users.
1924 // It is worth checking to see if the cann indvar is also
1925 // dead, so that we can remove it as well.
1927 // We can remove a PHI if it is on a cycle in the def-use graph
1928 // where each node in the cycle has degree one, i.e. only one use,
1929 // and is an instruction with no side effects.
1931 // FIXME: this needs to eliminate an induction variable even if it's being
1932 // compared against some value to decide loop termination.
1933 if (PN->hasOneUse()) {
1934 SmallPtrSet<PHINode *, 2> PHIs;
1935 for (Instruction *J = dyn_cast<Instruction>(*PN->use_begin());
1936 J && J->hasOneUse() && !J->mayWriteToMemory();
1937 J = dyn_cast<Instruction>(*J->use_begin())) {
1938 // If we find the original PHI, we've discovered a cycle.
1940 // Break the cycle and mark the PHI for deletion.
1941 SE->deleteValueFromRecords(PN);
1942 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
1943 DeadInsts.insert(PN);
1947 // If we find a PHI more than once, we're on a cycle that
1948 // won't prove fruitful.
1949 if (isa<PHINode>(J) && !PHIs.insert(cast<PHINode>(J)))
1954 DeleteTriviallyDeadInstructions(DeadInsts);