1 //===- LoopStrengthReduce.cpp - Strength Reduce IVs in Loops --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This transformation analyzes and transforms the induction variables (and
11 // computations derived from them) into forms suitable for efficient execution
14 // This pass performs a strength reduction on array references inside loops that
15 // have as one or more of their components the loop induction variable, it
16 // rewrites expressions to take advantage of scaled-index addressing modes
17 // available on the target, and it performs a variety of other optimizations
18 // related to loop induction variables.
20 // Terminology note: this code has a lot of handling for "post-increment" or
21 // "post-inc" users. This is not talking about post-increment addressing modes;
22 // it is instead talking about code like this:
24 // %i = phi [ 0, %entry ], [ %i.next, %latch ]
26 // %i.next = add %i, 1
27 // %c = icmp eq %i.next, %n
29 // The SCEV for %i is {0,+,1}<%L>. The SCEV for %i.next is {1,+,1}<%L>, however
30 // it's useful to think about these as the same register, with some uses using
31 // the value of the register before the add and some using // it after. In this
32 // example, the icmp is a post-increment user, since it uses %i.next, which is
33 // the value of the induction variable after the increment. The other common
34 // case of post-increment users is users outside the loop.
36 // TODO: More sophistication in the way Formulae are generated and filtered.
38 // TODO: Handle multiple loops at a time.
40 // TODO: Should TargetLowering::AddrMode::BaseGV be changed to a ConstantExpr
41 // instead of a GlobalValue?
43 // TODO: When truncation is free, truncate ICmp users' operands to make it a
44 // smaller encoding (on x86 at least).
46 // TODO: When a negated register is used by an add (such as in a list of
47 // multiple base registers, or as the increment expression in an addrec),
48 // we may not actually need both reg and (-1 * reg) in registers; the
49 // negation can be implemented by using a sub instead of an add. The
50 // lack of support for taking this into consideration when making
51 // register pressure decisions is partly worked around by the "Special"
54 //===----------------------------------------------------------------------===//
56 #define DEBUG_TYPE "loop-reduce"
57 #include "llvm/Transforms/Scalar.h"
58 #include "llvm/Constants.h"
59 #include "llvm/Instructions.h"
60 #include "llvm/IntrinsicInst.h"
61 #include "llvm/DerivedTypes.h"
62 #include "llvm/Analysis/IVUsers.h"
63 #include "llvm/Analysis/Dominators.h"
64 #include "llvm/Analysis/LoopPass.h"
65 #include "llvm/Analysis/ScalarEvolutionExpander.h"
66 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
67 #include "llvm/Transforms/Utils/Local.h"
68 #include "llvm/ADT/SmallBitVector.h"
69 #include "llvm/ADT/SetVector.h"
70 #include "llvm/ADT/DenseSet.h"
71 #include "llvm/Support/Debug.h"
72 #include "llvm/Support/ValueHandle.h"
73 #include "llvm/Support/raw_ostream.h"
74 #include "llvm/Target/TargetLowering.h"
80 /// RegSortData - This class holds data which is used to order reuse candidates.
83 /// UsedByIndices - This represents the set of LSRUse indices which reference
84 /// a particular register.
85 SmallBitVector UsedByIndices;
89 void print(raw_ostream &OS) const;
95 void RegSortData::print(raw_ostream &OS) const {
96 OS << "[NumUses=" << UsedByIndices.count() << ']';
99 void RegSortData::dump() const {
100 print(errs()); errs() << '\n';
105 /// RegUseTracker - Map register candidates to information about how they are
107 class RegUseTracker {
108 typedef DenseMap<const SCEV *, RegSortData> RegUsesTy;
110 RegUsesTy RegUsesMap;
111 SmallVector<const SCEV *, 16> RegSequence;
114 void CountRegister(const SCEV *Reg, size_t LUIdx);
115 void DropRegister(const SCEV *Reg, size_t LUIdx);
116 void DropUse(size_t LUIdx);
118 bool isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const;
120 const SmallBitVector &getUsedByIndices(const SCEV *Reg) const;
124 typedef SmallVectorImpl<const SCEV *>::iterator iterator;
125 typedef SmallVectorImpl<const SCEV *>::const_iterator const_iterator;
126 iterator begin() { return RegSequence.begin(); }
127 iterator end() { return RegSequence.end(); }
128 const_iterator begin() const { return RegSequence.begin(); }
129 const_iterator end() const { return RegSequence.end(); }
135 RegUseTracker::CountRegister(const SCEV *Reg, size_t LUIdx) {
136 std::pair<RegUsesTy::iterator, bool> Pair =
137 RegUsesMap.insert(std::make_pair(Reg, RegSortData()));
138 RegSortData &RSD = Pair.first->second;
140 RegSequence.push_back(Reg);
141 RSD.UsedByIndices.resize(std::max(RSD.UsedByIndices.size(), LUIdx + 1));
142 RSD.UsedByIndices.set(LUIdx);
146 RegUseTracker::DropRegister(const SCEV *Reg, size_t LUIdx) {
147 RegUsesTy::iterator It = RegUsesMap.find(Reg);
148 assert(It != RegUsesMap.end());
149 RegSortData &RSD = It->second;
150 assert(RSD.UsedByIndices.size() > LUIdx);
151 RSD.UsedByIndices.reset(LUIdx);
155 RegUseTracker::DropUse(size_t LUIdx) {
156 // Remove the use index from every register's use list.
157 for (RegUsesTy::iterator I = RegUsesMap.begin(), E = RegUsesMap.end();
159 I->second.UsedByIndices.reset(LUIdx);
163 RegUseTracker::isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const {
164 RegUsesTy::const_iterator I = RegUsesMap.find(Reg);
165 if (I == RegUsesMap.end())
167 const SmallBitVector &UsedByIndices = I->second.UsedByIndices;
168 int i = UsedByIndices.find_first();
169 if (i == -1) return false;
170 if ((size_t)i != LUIdx) return true;
171 return UsedByIndices.find_next(i) != -1;
174 const SmallBitVector &RegUseTracker::getUsedByIndices(const SCEV *Reg) const {
175 RegUsesTy::const_iterator I = RegUsesMap.find(Reg);
176 assert(I != RegUsesMap.end() && "Unknown register!");
177 return I->second.UsedByIndices;
180 void RegUseTracker::clear() {
187 /// Formula - This class holds information that describes a formula for
188 /// computing satisfying a use. It may include broken-out immediates and scaled
191 /// AM - This is used to represent complex addressing, as well as other kinds
192 /// of interesting uses.
193 TargetLowering::AddrMode AM;
195 /// BaseRegs - The list of "base" registers for this use. When this is
196 /// non-empty, AM.HasBaseReg should be set to true.
197 SmallVector<const SCEV *, 2> BaseRegs;
199 /// ScaledReg - The 'scaled' register for this use. This should be non-null
200 /// when AM.Scale is not zero.
201 const SCEV *ScaledReg;
203 Formula() : ScaledReg(0) {}
205 void InitialMatch(const SCEV *S, Loop *L,
206 ScalarEvolution &SE, DominatorTree &DT);
208 unsigned getNumRegs() const;
209 const Type *getType() const;
211 void DeleteBaseReg(const SCEV *&S);
213 bool referencesReg(const SCEV *S) const;
214 bool hasRegsUsedByUsesOtherThan(size_t LUIdx,
215 const RegUseTracker &RegUses) const;
217 void print(raw_ostream &OS) const;
223 /// DoInitialMatch - Recursion helper for InitialMatch.
224 static void DoInitialMatch(const SCEV *S, Loop *L,
225 SmallVectorImpl<const SCEV *> &Good,
226 SmallVectorImpl<const SCEV *> &Bad,
227 ScalarEvolution &SE, DominatorTree &DT) {
228 // Collect expressions which properly dominate the loop header.
229 if (S->properlyDominates(L->getHeader(), &DT)) {
234 // Look at add operands.
235 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
236 for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end();
238 DoInitialMatch(*I, L, Good, Bad, SE, DT);
242 // Look at addrec operands.
243 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S))
244 if (!AR->getStart()->isZero()) {
245 DoInitialMatch(AR->getStart(), L, Good, Bad, SE, DT);
246 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0),
247 AR->getStepRecurrence(SE),
249 L, Good, Bad, SE, DT);
253 // Handle a multiplication by -1 (negation) if it didn't fold.
254 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S))
255 if (Mul->getOperand(0)->isAllOnesValue()) {
256 SmallVector<const SCEV *, 4> Ops(Mul->op_begin()+1, Mul->op_end());
257 const SCEV *NewMul = SE.getMulExpr(Ops);
259 SmallVector<const SCEV *, 4> MyGood;
260 SmallVector<const SCEV *, 4> MyBad;
261 DoInitialMatch(NewMul, L, MyGood, MyBad, SE, DT);
262 const SCEV *NegOne = SE.getSCEV(ConstantInt::getAllOnesValue(
263 SE.getEffectiveSCEVType(NewMul->getType())));
264 for (SmallVectorImpl<const SCEV *>::const_iterator I = MyGood.begin(),
265 E = MyGood.end(); I != E; ++I)
266 Good.push_back(SE.getMulExpr(NegOne, *I));
267 for (SmallVectorImpl<const SCEV *>::const_iterator I = MyBad.begin(),
268 E = MyBad.end(); I != E; ++I)
269 Bad.push_back(SE.getMulExpr(NegOne, *I));
273 // Ok, we can't do anything interesting. Just stuff the whole thing into a
274 // register and hope for the best.
278 /// InitialMatch - Incorporate loop-variant parts of S into this Formula,
279 /// attempting to keep all loop-invariant and loop-computable values in a
280 /// single base register.
281 void Formula::InitialMatch(const SCEV *S, Loop *L,
282 ScalarEvolution &SE, DominatorTree &DT) {
283 SmallVector<const SCEV *, 4> Good;
284 SmallVector<const SCEV *, 4> Bad;
285 DoInitialMatch(S, L, Good, Bad, SE, DT);
287 const SCEV *Sum = SE.getAddExpr(Good);
289 BaseRegs.push_back(Sum);
290 AM.HasBaseReg = true;
293 const SCEV *Sum = SE.getAddExpr(Bad);
295 BaseRegs.push_back(Sum);
296 AM.HasBaseReg = true;
300 /// getNumRegs - Return the total number of register operands used by this
301 /// formula. This does not include register uses implied by non-constant
303 unsigned Formula::getNumRegs() const {
304 return !!ScaledReg + BaseRegs.size();
307 /// getType - Return the type of this formula, if it has one, or null
308 /// otherwise. This type is meaningless except for the bit size.
309 const Type *Formula::getType() const {
310 return !BaseRegs.empty() ? BaseRegs.front()->getType() :
311 ScaledReg ? ScaledReg->getType() :
312 AM.BaseGV ? AM.BaseGV->getType() :
316 /// DeleteBaseReg - Delete the given base reg from the BaseRegs list.
317 void Formula::DeleteBaseReg(const SCEV *&S) {
318 if (&S != &BaseRegs.back())
319 std::swap(S, BaseRegs.back());
323 /// referencesReg - Test if this formula references the given register.
324 bool Formula::referencesReg(const SCEV *S) const {
325 return S == ScaledReg ||
326 std::find(BaseRegs.begin(), BaseRegs.end(), S) != BaseRegs.end();
329 /// hasRegsUsedByUsesOtherThan - Test whether this formula uses registers
330 /// which are used by uses other than the use with the given index.
331 bool Formula::hasRegsUsedByUsesOtherThan(size_t LUIdx,
332 const RegUseTracker &RegUses) const {
334 if (RegUses.isRegUsedByUsesOtherThan(ScaledReg, LUIdx))
336 for (SmallVectorImpl<const SCEV *>::const_iterator I = BaseRegs.begin(),
337 E = BaseRegs.end(); I != E; ++I)
338 if (RegUses.isRegUsedByUsesOtherThan(*I, LUIdx))
343 void Formula::print(raw_ostream &OS) const {
346 if (!First) OS << " + "; else First = false;
347 WriteAsOperand(OS, AM.BaseGV, /*PrintType=*/false);
349 if (AM.BaseOffs != 0) {
350 if (!First) OS << " + "; else First = false;
353 for (SmallVectorImpl<const SCEV *>::const_iterator I = BaseRegs.begin(),
354 E = BaseRegs.end(); I != E; ++I) {
355 if (!First) OS << " + "; else First = false;
356 OS << "reg(" << **I << ')';
358 if (AM.HasBaseReg && BaseRegs.empty()) {
359 if (!First) OS << " + "; else First = false;
360 OS << "**error: HasBaseReg**";
361 } else if (!AM.HasBaseReg && !BaseRegs.empty()) {
362 if (!First) OS << " + "; else First = false;
363 OS << "**error: !HasBaseReg**";
366 if (!First) OS << " + "; else First = false;
367 OS << AM.Scale << "*reg(";
376 void Formula::dump() const {
377 print(errs()); errs() << '\n';
380 /// isAddRecSExtable - Return true if the given addrec can be sign-extended
381 /// without changing its value.
382 static bool isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) {
384 IntegerType::get(SE.getContext(), SE.getTypeSizeInBits(AR->getType()) + 1);
385 return isa<SCEVAddRecExpr>(SE.getSignExtendExpr(AR, WideTy));
388 /// isAddSExtable - Return true if the given add can be sign-extended
389 /// without changing its value.
390 static bool isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) {
392 IntegerType::get(SE.getContext(), SE.getTypeSizeInBits(A->getType()) + 1);
393 return isa<SCEVAddExpr>(SE.getSignExtendExpr(A, WideTy));
396 /// isMulSExtable - Return true if the given mul can be sign-extended
397 /// without changing its value.
398 static bool isMulSExtable(const SCEVMulExpr *M, ScalarEvolution &SE) {
400 IntegerType::get(SE.getContext(),
401 SE.getTypeSizeInBits(M->getType()) * M->getNumOperands());
402 return isa<SCEVMulExpr>(SE.getSignExtendExpr(M, WideTy));
405 /// getExactSDiv - Return an expression for LHS /s RHS, if it can be determined
406 /// and if the remainder is known to be zero, or null otherwise. If
407 /// IgnoreSignificantBits is true, expressions like (X * Y) /s Y are simplified
408 /// to Y, ignoring that the multiplication may overflow, which is useful when
409 /// the result will be used in a context where the most significant bits are
411 static const SCEV *getExactSDiv(const SCEV *LHS, const SCEV *RHS,
413 bool IgnoreSignificantBits = false) {
414 // Handle the trivial case, which works for any SCEV type.
416 return SE.getConstant(LHS->getType(), 1);
418 // Handle a few RHS special cases.
419 const SCEVConstant *RC = dyn_cast<SCEVConstant>(RHS);
421 const APInt &RA = RC->getValue()->getValue();
422 // Handle x /s -1 as x * -1, to give ScalarEvolution a chance to do
424 if (RA.isAllOnesValue())
425 return SE.getMulExpr(LHS, RC);
426 // Handle x /s 1 as x.
431 // Check for a division of a constant by a constant.
432 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(LHS)) {
435 const APInt &LA = C->getValue()->getValue();
436 const APInt &RA = RC->getValue()->getValue();
437 if (LA.srem(RA) != 0)
439 return SE.getConstant(LA.sdiv(RA));
442 // Distribute the sdiv over addrec operands, if the addrec doesn't overflow.
443 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(LHS)) {
444 if (IgnoreSignificantBits || isAddRecSExtable(AR, SE)) {
445 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE,
446 IgnoreSignificantBits);
448 const SCEV *Start = getExactSDiv(AR->getStart(), RHS, SE,
449 IgnoreSignificantBits);
450 if (!Start) return 0;
451 return SE.getAddRecExpr(Start, Step, AR->getLoop());
456 // Distribute the sdiv over add operands, if the add doesn't overflow.
457 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(LHS)) {
458 if (IgnoreSignificantBits || isAddSExtable(Add, SE)) {
459 SmallVector<const SCEV *, 8> Ops;
460 for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end();
462 const SCEV *Op = getExactSDiv(*I, RHS, SE,
463 IgnoreSignificantBits);
467 return SE.getAddExpr(Ops);
472 // Check for a multiply operand that we can pull RHS out of.
473 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(LHS)) {
474 if (IgnoreSignificantBits || isMulSExtable(Mul, SE)) {
475 SmallVector<const SCEV *, 4> Ops;
477 for (SCEVMulExpr::op_iterator I = Mul->op_begin(), E = Mul->op_end();
481 if (const SCEV *Q = getExactSDiv(S, RHS, SE,
482 IgnoreSignificantBits)) {
488 return Found ? SE.getMulExpr(Ops) : 0;
493 // Otherwise we don't know.
497 /// ExtractImmediate - If S involves the addition of a constant integer value,
498 /// return that integer value, and mutate S to point to a new SCEV with that
500 static int64_t ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) {
501 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(S)) {
502 if (C->getValue()->getValue().getMinSignedBits() <= 64) {
503 S = SE.getConstant(C->getType(), 0);
504 return C->getValue()->getSExtValue();
506 } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
507 SmallVector<const SCEV *, 8> NewOps(Add->op_begin(), Add->op_end());
508 int64_t Result = ExtractImmediate(NewOps.front(), SE);
510 S = SE.getAddExpr(NewOps);
512 } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
513 SmallVector<const SCEV *, 8> NewOps(AR->op_begin(), AR->op_end());
514 int64_t Result = ExtractImmediate(NewOps.front(), SE);
516 S = SE.getAddRecExpr(NewOps, AR->getLoop());
522 /// ExtractSymbol - If S involves the addition of a GlobalValue address,
523 /// return that symbol, and mutate S to point to a new SCEV with that
525 static GlobalValue *ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) {
526 if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) {
527 if (GlobalValue *GV = dyn_cast<GlobalValue>(U->getValue())) {
528 S = SE.getConstant(GV->getType(), 0);
531 } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
532 SmallVector<const SCEV *, 8> NewOps(Add->op_begin(), Add->op_end());
533 GlobalValue *Result = ExtractSymbol(NewOps.back(), SE);
535 S = SE.getAddExpr(NewOps);
537 } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
538 SmallVector<const SCEV *, 8> NewOps(AR->op_begin(), AR->op_end());
539 GlobalValue *Result = ExtractSymbol(NewOps.front(), SE);
541 S = SE.getAddRecExpr(NewOps, AR->getLoop());
547 /// isAddressUse - Returns true if the specified instruction is using the
548 /// specified value as an address.
549 static bool isAddressUse(Instruction *Inst, Value *OperandVal) {
550 bool isAddress = isa<LoadInst>(Inst);
551 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
552 if (SI->getOperand(1) == OperandVal)
554 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
555 // Addressing modes can also be folded into prefetches and a variety
557 switch (II->getIntrinsicID()) {
559 case Intrinsic::prefetch:
560 case Intrinsic::x86_sse2_loadu_dq:
561 case Intrinsic::x86_sse2_loadu_pd:
562 case Intrinsic::x86_sse_loadu_ps:
563 case Intrinsic::x86_sse_storeu_ps:
564 case Intrinsic::x86_sse2_storeu_pd:
565 case Intrinsic::x86_sse2_storeu_dq:
566 case Intrinsic::x86_sse2_storel_dq:
567 if (II->getArgOperand(0) == OperandVal)
575 /// getAccessType - Return the type of the memory being accessed.
576 static const Type *getAccessType(const Instruction *Inst) {
577 const Type *AccessTy = Inst->getType();
578 if (const StoreInst *SI = dyn_cast<StoreInst>(Inst))
579 AccessTy = SI->getOperand(0)->getType();
580 else if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
581 // Addressing modes can also be folded into prefetches and a variety
583 switch (II->getIntrinsicID()) {
585 case Intrinsic::x86_sse_storeu_ps:
586 case Intrinsic::x86_sse2_storeu_pd:
587 case Intrinsic::x86_sse2_storeu_dq:
588 case Intrinsic::x86_sse2_storel_dq:
589 AccessTy = II->getArgOperand(0)->getType();
594 // All pointers have the same requirements, so canonicalize them to an
595 // arbitrary pointer type to minimize variation.
596 if (const PointerType *PTy = dyn_cast<PointerType>(AccessTy))
597 AccessTy = PointerType::get(IntegerType::get(PTy->getContext(), 1),
598 PTy->getAddressSpace());
603 /// DeleteTriviallyDeadInstructions - If any of the instructions is the
604 /// specified set are trivially dead, delete them and see if this makes any of
605 /// their operands subsequently dead.
607 DeleteTriviallyDeadInstructions(SmallVectorImpl<WeakVH> &DeadInsts) {
608 bool Changed = false;
610 while (!DeadInsts.empty()) {
611 Instruction *I = dyn_cast_or_null<Instruction>(DeadInsts.pop_back_val());
613 if (I == 0 || !isInstructionTriviallyDead(I))
616 for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI)
617 if (Instruction *U = dyn_cast<Instruction>(*OI)) {
620 DeadInsts.push_back(U);
623 I->eraseFromParent();
632 /// Cost - This class is used to measure and compare candidate formulae.
634 /// TODO: Some of these could be merged. Also, a lexical ordering
635 /// isn't always optimal.
639 unsigned NumBaseAdds;
645 : NumRegs(0), AddRecCost(0), NumIVMuls(0), NumBaseAdds(0), ImmCost(0),
648 unsigned getNumRegs() const { return NumRegs; }
650 bool operator<(const Cost &Other) const;
654 void RateFormula(const Formula &F,
655 SmallPtrSet<const SCEV *, 16> &Regs,
656 const DenseSet<const SCEV *> &VisitedRegs,
658 const SmallVectorImpl<int64_t> &Offsets,
659 ScalarEvolution &SE, DominatorTree &DT);
661 void print(raw_ostream &OS) const;
665 void RateRegister(const SCEV *Reg,
666 SmallPtrSet<const SCEV *, 16> &Regs,
668 ScalarEvolution &SE, DominatorTree &DT);
669 void RatePrimaryRegister(const SCEV *Reg,
670 SmallPtrSet<const SCEV *, 16> &Regs,
672 ScalarEvolution &SE, DominatorTree &DT);
677 /// RateRegister - Tally up interesting quantities from the given register.
678 void Cost::RateRegister(const SCEV *Reg,
679 SmallPtrSet<const SCEV *, 16> &Regs,
681 ScalarEvolution &SE, DominatorTree &DT) {
682 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Reg)) {
683 if (AR->getLoop() == L)
684 AddRecCost += 1; /// TODO: This should be a function of the stride.
686 // If this is an addrec for a loop that's already been visited by LSR,
687 // don't second-guess its addrec phi nodes. LSR isn't currently smart
688 // enough to reason about more than one loop at a time. Consider these
689 // registers free and leave them alone.
690 else if (L->contains(AR->getLoop()) ||
691 (!AR->getLoop()->contains(L) &&
692 DT.dominates(L->getHeader(), AR->getLoop()->getHeader()))) {
693 for (BasicBlock::iterator I = AR->getLoop()->getHeader()->begin();
694 PHINode *PN = dyn_cast<PHINode>(I); ++I)
695 if (SE.isSCEVable(PN->getType()) &&
696 (SE.getEffectiveSCEVType(PN->getType()) ==
697 SE.getEffectiveSCEVType(AR->getType())) &&
698 SE.getSCEV(PN) == AR)
701 // If this isn't one of the addrecs that the loop already has, it
702 // would require a costly new phi and add. TODO: This isn't
703 // precisely modeled right now.
705 if (!Regs.count(AR->getStart()))
706 RateRegister(AR->getStart(), Regs, L, SE, DT);
709 // Add the step value register, if it needs one.
710 // TODO: The non-affine case isn't precisely modeled here.
711 if (!AR->isAffine() || !isa<SCEVConstant>(AR->getOperand(1)))
712 if (!Regs.count(AR->getStart()))
713 RateRegister(AR->getOperand(1), Regs, L, SE, DT);
717 // Rough heuristic; favor registers which don't require extra setup
718 // instructions in the preheader.
719 if (!isa<SCEVUnknown>(Reg) &&
720 !isa<SCEVConstant>(Reg) &&
721 !(isa<SCEVAddRecExpr>(Reg) &&
722 (isa<SCEVUnknown>(cast<SCEVAddRecExpr>(Reg)->getStart()) ||
723 isa<SCEVConstant>(cast<SCEVAddRecExpr>(Reg)->getStart()))))
727 /// RatePrimaryRegister - Record this register in the set. If we haven't seen it
729 void Cost::RatePrimaryRegister(const SCEV *Reg,
730 SmallPtrSet<const SCEV *, 16> &Regs,
732 ScalarEvolution &SE, DominatorTree &DT) {
733 if (Regs.insert(Reg))
734 RateRegister(Reg, Regs, L, SE, DT);
737 void Cost::RateFormula(const Formula &F,
738 SmallPtrSet<const SCEV *, 16> &Regs,
739 const DenseSet<const SCEV *> &VisitedRegs,
741 const SmallVectorImpl<int64_t> &Offsets,
742 ScalarEvolution &SE, DominatorTree &DT) {
743 // Tally up the registers.
744 if (const SCEV *ScaledReg = F.ScaledReg) {
745 if (VisitedRegs.count(ScaledReg)) {
749 RatePrimaryRegister(ScaledReg, Regs, L, SE, DT);
751 for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(),
752 E = F.BaseRegs.end(); I != E; ++I) {
753 const SCEV *BaseReg = *I;
754 if (VisitedRegs.count(BaseReg)) {
758 RatePrimaryRegister(BaseReg, Regs, L, SE, DT);
760 NumIVMuls += isa<SCEVMulExpr>(BaseReg) &&
761 BaseReg->hasComputableLoopEvolution(L);
764 if (F.BaseRegs.size() > 1)
765 NumBaseAdds += F.BaseRegs.size() - 1;
767 // Tally up the non-zero immediates.
768 for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(),
769 E = Offsets.end(); I != E; ++I) {
770 int64_t Offset = (uint64_t)*I + F.AM.BaseOffs;
772 ImmCost += 64; // Handle symbolic values conservatively.
773 // TODO: This should probably be the pointer size.
774 else if (Offset != 0)
775 ImmCost += APInt(64, Offset, true).getMinSignedBits();
779 /// Loose - Set this cost to a loosing value.
789 /// operator< - Choose the lower cost.
790 bool Cost::operator<(const Cost &Other) const {
791 if (NumRegs != Other.NumRegs)
792 return NumRegs < Other.NumRegs;
793 if (AddRecCost != Other.AddRecCost)
794 return AddRecCost < Other.AddRecCost;
795 if (NumIVMuls != Other.NumIVMuls)
796 return NumIVMuls < Other.NumIVMuls;
797 if (NumBaseAdds != Other.NumBaseAdds)
798 return NumBaseAdds < Other.NumBaseAdds;
799 if (ImmCost != Other.ImmCost)
800 return ImmCost < Other.ImmCost;
801 if (SetupCost != Other.SetupCost)
802 return SetupCost < Other.SetupCost;
806 void Cost::print(raw_ostream &OS) const {
807 OS << NumRegs << " reg" << (NumRegs == 1 ? "" : "s");
809 OS << ", with addrec cost " << AddRecCost;
811 OS << ", plus " << NumIVMuls << " IV mul" << (NumIVMuls == 1 ? "" : "s");
812 if (NumBaseAdds != 0)
813 OS << ", plus " << NumBaseAdds << " base add"
814 << (NumBaseAdds == 1 ? "" : "s");
816 OS << ", plus " << ImmCost << " imm cost";
818 OS << ", plus " << SetupCost << " setup cost";
821 void Cost::dump() const {
822 print(errs()); errs() << '\n';
827 /// LSRFixup - An operand value in an instruction which is to be replaced
828 /// with some equivalent, possibly strength-reduced, replacement.
830 /// UserInst - The instruction which will be updated.
831 Instruction *UserInst;
833 /// OperandValToReplace - The operand of the instruction which will
834 /// be replaced. The operand may be used more than once; every instance
835 /// will be replaced.
836 Value *OperandValToReplace;
838 /// PostIncLoops - If this user is to use the post-incremented value of an
839 /// induction variable, this variable is non-null and holds the loop
840 /// associated with the induction variable.
841 PostIncLoopSet PostIncLoops;
843 /// LUIdx - The index of the LSRUse describing the expression which
844 /// this fixup needs, minus an offset (below).
847 /// Offset - A constant offset to be added to the LSRUse expression.
848 /// This allows multiple fixups to share the same LSRUse with different
849 /// offsets, for example in an unrolled loop.
852 bool isUseFullyOutsideLoop(const Loop *L) const;
856 void print(raw_ostream &OS) const;
863 : UserInst(0), OperandValToReplace(0), LUIdx(~size_t(0)), Offset(0) {}
865 /// isUseFullyOutsideLoop - Test whether this fixup always uses its
866 /// value outside of the given loop.
867 bool LSRFixup::isUseFullyOutsideLoop(const Loop *L) const {
868 // PHI nodes use their value in their incoming blocks.
869 if (const PHINode *PN = dyn_cast<PHINode>(UserInst)) {
870 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
871 if (PN->getIncomingValue(i) == OperandValToReplace &&
872 L->contains(PN->getIncomingBlock(i)))
877 return !L->contains(UserInst);
880 void LSRFixup::print(raw_ostream &OS) const {
882 // Store is common and interesting enough to be worth special-casing.
883 if (StoreInst *Store = dyn_cast<StoreInst>(UserInst)) {
885 WriteAsOperand(OS, Store->getOperand(0), /*PrintType=*/false);
886 } else if (UserInst->getType()->isVoidTy())
887 OS << UserInst->getOpcodeName();
889 WriteAsOperand(OS, UserInst, /*PrintType=*/false);
891 OS << ", OperandValToReplace=";
892 WriteAsOperand(OS, OperandValToReplace, /*PrintType=*/false);
894 for (PostIncLoopSet::const_iterator I = PostIncLoops.begin(),
895 E = PostIncLoops.end(); I != E; ++I) {
896 OS << ", PostIncLoop=";
897 WriteAsOperand(OS, (*I)->getHeader(), /*PrintType=*/false);
900 if (LUIdx != ~size_t(0))
901 OS << ", LUIdx=" << LUIdx;
904 OS << ", Offset=" << Offset;
907 void LSRFixup::dump() const {
908 print(errs()); errs() << '\n';
913 /// UniquifierDenseMapInfo - A DenseMapInfo implementation for holding
914 /// DenseMaps and DenseSets of sorted SmallVectors of const SCEV*.
915 struct UniquifierDenseMapInfo {
916 static SmallVector<const SCEV *, 2> getEmptyKey() {
917 SmallVector<const SCEV *, 2> V;
918 V.push_back(reinterpret_cast<const SCEV *>(-1));
922 static SmallVector<const SCEV *, 2> getTombstoneKey() {
923 SmallVector<const SCEV *, 2> V;
924 V.push_back(reinterpret_cast<const SCEV *>(-2));
928 static unsigned getHashValue(const SmallVector<const SCEV *, 2> &V) {
930 for (SmallVectorImpl<const SCEV *>::const_iterator I = V.begin(),
931 E = V.end(); I != E; ++I)
932 Result ^= DenseMapInfo<const SCEV *>::getHashValue(*I);
936 static bool isEqual(const SmallVector<const SCEV *, 2> &LHS,
937 const SmallVector<const SCEV *, 2> &RHS) {
942 /// LSRUse - This class holds the state that LSR keeps for each use in
943 /// IVUsers, as well as uses invented by LSR itself. It includes information
944 /// about what kinds of things can be folded into the user, information about
945 /// the user itself, and information about how the use may be satisfied.
946 /// TODO: Represent multiple users of the same expression in common?
948 DenseSet<SmallVector<const SCEV *, 2>, UniquifierDenseMapInfo> Uniquifier;
951 /// KindType - An enum for a kind of use, indicating what types of
952 /// scaled and immediate operands it might support.
954 Basic, ///< A normal use, with no folding.
955 Special, ///< A special case of basic, allowing -1 scales.
956 Address, ///< An address use; folding according to TargetLowering
957 ICmpZero ///< An equality icmp with both operands folded into one.
958 // TODO: Add a generic icmp too?
962 const Type *AccessTy;
964 SmallVector<int64_t, 8> Offsets;
968 /// AllFixupsOutsideLoop - This records whether all of the fixups using this
969 /// LSRUse are outside of the loop, in which case some special-case heuristics
971 bool AllFixupsOutsideLoop;
973 /// WidestFixupType - This records the widest use type for any fixup using
974 /// this LSRUse. FindUseWithSimilarFormula can't consider uses with different
975 /// max fixup widths to be equivalent, because the narrower one may be relying
976 /// on the implicit truncation to truncate away bogus bits.
977 const Type *WidestFixupType;
979 /// Formulae - A list of ways to build a value that can satisfy this user.
980 /// After the list is populated, one of these is selected heuristically and
981 /// used to formulate a replacement for OperandValToReplace in UserInst.
982 SmallVector<Formula, 12> Formulae;
984 /// Regs - The set of register candidates used by all formulae in this LSRUse.
985 SmallPtrSet<const SCEV *, 4> Regs;
987 LSRUse(KindType K, const Type *T) : Kind(K), AccessTy(T),
988 MinOffset(INT64_MAX),
989 MaxOffset(INT64_MIN),
990 AllFixupsOutsideLoop(true),
991 WidestFixupType(0) {}
993 bool HasFormulaWithSameRegs(const Formula &F) const;
994 bool InsertFormula(const Formula &F);
995 void DeleteFormula(Formula &F);
996 void RecomputeRegs(size_t LUIdx, RegUseTracker &Reguses);
1000 void print(raw_ostream &OS) const;
1006 /// HasFormula - Test whether this use as a formula which has the same
1007 /// registers as the given formula.
1008 bool LSRUse::HasFormulaWithSameRegs(const Formula &F) const {
1009 SmallVector<const SCEV *, 2> Key = F.BaseRegs;
1010 if (F.ScaledReg) Key.push_back(F.ScaledReg);
1011 // Unstable sort by host order ok, because this is only used for uniquifying.
1012 std::sort(Key.begin(), Key.end());
1013 return Uniquifier.count(Key);
1016 /// InsertFormula - If the given formula has not yet been inserted, add it to
1017 /// the list, and return true. Return false otherwise.
1018 bool LSRUse::InsertFormula(const Formula &F) {
1019 SmallVector<const SCEV *, 2> Key = F.BaseRegs;
1020 if (F.ScaledReg) Key.push_back(F.ScaledReg);
1021 // Unstable sort by host order ok, because this is only used for uniquifying.
1022 std::sort(Key.begin(), Key.end());
1024 if (!Uniquifier.insert(Key).second)
1027 // Using a register to hold the value of 0 is not profitable.
1028 assert((!F.ScaledReg || !F.ScaledReg->isZero()) &&
1029 "Zero allocated in a scaled register!");
1031 for (SmallVectorImpl<const SCEV *>::const_iterator I =
1032 F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I)
1033 assert(!(*I)->isZero() && "Zero allocated in a base register!");
1036 // Add the formula to the list.
1037 Formulae.push_back(F);
1039 // Record registers now being used by this use.
1040 if (F.ScaledReg) Regs.insert(F.ScaledReg);
1041 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end());
1046 /// DeleteFormula - Remove the given formula from this use's list.
1047 void LSRUse::DeleteFormula(Formula &F) {
1048 if (&F != &Formulae.back())
1049 std::swap(F, Formulae.back());
1050 Formulae.pop_back();
1051 assert(!Formulae.empty() && "LSRUse has no formulae left!");
1054 /// RecomputeRegs - Recompute the Regs field, and update RegUses.
1055 void LSRUse::RecomputeRegs(size_t LUIdx, RegUseTracker &RegUses) {
1056 // Now that we've filtered out some formulae, recompute the Regs set.
1057 SmallPtrSet<const SCEV *, 4> OldRegs = Regs;
1059 for (SmallVectorImpl<Formula>::const_iterator I = Formulae.begin(),
1060 E = Formulae.end(); I != E; ++I) {
1061 const Formula &F = *I;
1062 if (F.ScaledReg) Regs.insert(F.ScaledReg);
1063 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end());
1066 // Update the RegTracker.
1067 for (SmallPtrSet<const SCEV *, 4>::iterator I = OldRegs.begin(),
1068 E = OldRegs.end(); I != E; ++I)
1069 if (!Regs.count(*I))
1070 RegUses.DropRegister(*I, LUIdx);
1073 void LSRUse::print(raw_ostream &OS) const {
1074 OS << "LSR Use: Kind=";
1076 case Basic: OS << "Basic"; break;
1077 case Special: OS << "Special"; break;
1078 case ICmpZero: OS << "ICmpZero"; break;
1080 OS << "Address of ";
1081 if (AccessTy->isPointerTy())
1082 OS << "pointer"; // the full pointer type could be really verbose
1087 OS << ", Offsets={";
1088 for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(),
1089 E = Offsets.end(); I != E; ++I) {
1091 if (llvm::next(I) != E)
1096 if (AllFixupsOutsideLoop)
1097 OS << ", all-fixups-outside-loop";
1099 if (WidestFixupType)
1100 OS << ", widest fixup type: " << *WidestFixupType;
1103 void LSRUse::dump() const {
1104 print(errs()); errs() << '\n';
1107 /// isLegalUse - Test whether the use described by AM is "legal", meaning it can
1108 /// be completely folded into the user instruction at isel time. This includes
1109 /// address-mode folding and special icmp tricks.
1110 static bool isLegalUse(const TargetLowering::AddrMode &AM,
1111 LSRUse::KindType Kind, const Type *AccessTy,
1112 const TargetLowering *TLI) {
1114 case LSRUse::Address:
1115 // If we have low-level target information, ask the target if it can
1116 // completely fold this address.
1117 if (TLI) return TLI->isLegalAddressingMode(AM, AccessTy);
1119 // Otherwise, just guess that reg+reg addressing is legal.
1120 return !AM.BaseGV && AM.BaseOffs == 0 && AM.Scale <= 1;
1122 case LSRUse::ICmpZero:
1123 // There's not even a target hook for querying whether it would be legal to
1124 // fold a GV into an ICmp.
1128 // ICmp only has two operands; don't allow more than two non-trivial parts.
1129 if (AM.Scale != 0 && AM.HasBaseReg && AM.BaseOffs != 0)
1132 // ICmp only supports no scale or a -1 scale, as we can "fold" a -1 scale by
1133 // putting the scaled register in the other operand of the icmp.
1134 if (AM.Scale != 0 && AM.Scale != -1)
1137 // If we have low-level target information, ask the target if it can fold an
1138 // integer immediate on an icmp.
1139 if (AM.BaseOffs != 0) {
1140 if (TLI) return TLI->isLegalICmpImmediate(-AM.BaseOffs);
1147 // Only handle single-register values.
1148 return !AM.BaseGV && AM.Scale == 0 && AM.BaseOffs == 0;
1150 case LSRUse::Special:
1151 // Only handle -1 scales, or no scale.
1152 return AM.Scale == 0 || AM.Scale == -1;
1158 static bool isLegalUse(TargetLowering::AddrMode AM,
1159 int64_t MinOffset, int64_t MaxOffset,
1160 LSRUse::KindType Kind, const Type *AccessTy,
1161 const TargetLowering *TLI) {
1162 // Check for overflow.
1163 if (((int64_t)((uint64_t)AM.BaseOffs + MinOffset) > AM.BaseOffs) !=
1166 AM.BaseOffs = (uint64_t)AM.BaseOffs + MinOffset;
1167 if (isLegalUse(AM, Kind, AccessTy, TLI)) {
1168 AM.BaseOffs = (uint64_t)AM.BaseOffs - MinOffset;
1169 // Check for overflow.
1170 if (((int64_t)((uint64_t)AM.BaseOffs + MaxOffset) > AM.BaseOffs) !=
1173 AM.BaseOffs = (uint64_t)AM.BaseOffs + MaxOffset;
1174 return isLegalUse(AM, Kind, AccessTy, TLI);
1179 static bool isAlwaysFoldable(int64_t BaseOffs,
1180 GlobalValue *BaseGV,
1182 LSRUse::KindType Kind, const Type *AccessTy,
1183 const TargetLowering *TLI) {
1184 // Fast-path: zero is always foldable.
1185 if (BaseOffs == 0 && !BaseGV) return true;
1187 // Conservatively, create an address with an immediate and a
1188 // base and a scale.
1189 TargetLowering::AddrMode AM;
1190 AM.BaseOffs = BaseOffs;
1192 AM.HasBaseReg = HasBaseReg;
1193 AM.Scale = Kind == LSRUse::ICmpZero ? -1 : 1;
1195 // Canonicalize a scale of 1 to a base register if the formula doesn't
1196 // already have a base register.
1197 if (!AM.HasBaseReg && AM.Scale == 1) {
1199 AM.HasBaseReg = true;
1202 return isLegalUse(AM, Kind, AccessTy, TLI);
1205 static bool isAlwaysFoldable(const SCEV *S,
1206 int64_t MinOffset, int64_t MaxOffset,
1208 LSRUse::KindType Kind, const Type *AccessTy,
1209 const TargetLowering *TLI,
1210 ScalarEvolution &SE) {
1211 // Fast-path: zero is always foldable.
1212 if (S->isZero()) return true;
1214 // Conservatively, create an address with an immediate and a
1215 // base and a scale.
1216 int64_t BaseOffs = ExtractImmediate(S, SE);
1217 GlobalValue *BaseGV = ExtractSymbol(S, SE);
1219 // If there's anything else involved, it's not foldable.
1220 if (!S->isZero()) return false;
1222 // Fast-path: zero is always foldable.
1223 if (BaseOffs == 0 && !BaseGV) return true;
1225 // Conservatively, create an address with an immediate and a
1226 // base and a scale.
1227 TargetLowering::AddrMode AM;
1228 AM.BaseOffs = BaseOffs;
1230 AM.HasBaseReg = HasBaseReg;
1231 AM.Scale = Kind == LSRUse::ICmpZero ? -1 : 1;
1233 return isLegalUse(AM, MinOffset, MaxOffset, Kind, AccessTy, TLI);
1238 /// UseMapDenseMapInfo - A DenseMapInfo implementation for holding
1239 /// DenseMaps and DenseSets of pairs of const SCEV* and LSRUse::Kind.
1240 struct UseMapDenseMapInfo {
1241 static std::pair<const SCEV *, LSRUse::KindType> getEmptyKey() {
1242 return std::make_pair(reinterpret_cast<const SCEV *>(-1), LSRUse::Basic);
1245 static std::pair<const SCEV *, LSRUse::KindType> getTombstoneKey() {
1246 return std::make_pair(reinterpret_cast<const SCEV *>(-2), LSRUse::Basic);
1250 getHashValue(const std::pair<const SCEV *, LSRUse::KindType> &V) {
1251 unsigned Result = DenseMapInfo<const SCEV *>::getHashValue(V.first);
1252 Result ^= DenseMapInfo<unsigned>::getHashValue(unsigned(V.second));
1256 static bool isEqual(const std::pair<const SCEV *, LSRUse::KindType> &LHS,
1257 const std::pair<const SCEV *, LSRUse::KindType> &RHS) {
1262 /// FormulaSorter - This class implements an ordering for formulae which sorts
1263 /// the by their standalone cost.
1264 class FormulaSorter {
1265 /// These two sets are kept empty, so that we compute standalone costs.
1266 DenseSet<const SCEV *> VisitedRegs;
1267 SmallPtrSet<const SCEV *, 16> Regs;
1270 ScalarEvolution &SE;
1274 FormulaSorter(Loop *l, LSRUse &lu, ScalarEvolution &se, DominatorTree &dt)
1275 : L(l), LU(&lu), SE(se), DT(dt) {}
1277 bool operator()(const Formula &A, const Formula &B) {
1279 CostA.RateFormula(A, Regs, VisitedRegs, L, LU->Offsets, SE, DT);
1282 CostB.RateFormula(B, Regs, VisitedRegs, L, LU->Offsets, SE, DT);
1284 return CostA < CostB;
1288 /// LSRInstance - This class holds state for the main loop strength reduction
1292 ScalarEvolution &SE;
1295 const TargetLowering *const TLI;
1299 /// IVIncInsertPos - This is the insert position that the current loop's
1300 /// induction variable increment should be placed. In simple loops, this is
1301 /// the latch block's terminator. But in more complicated cases, this is a
1302 /// position which will dominate all the in-loop post-increment users.
1303 Instruction *IVIncInsertPos;
1305 /// Factors - Interesting factors between use strides.
1306 SmallSetVector<int64_t, 8> Factors;
1308 /// Types - Interesting use types, to facilitate truncation reuse.
1309 SmallSetVector<const Type *, 4> Types;
1311 /// Fixups - The list of operands which are to be replaced.
1312 SmallVector<LSRFixup, 16> Fixups;
1314 /// Uses - The list of interesting uses.
1315 SmallVector<LSRUse, 16> Uses;
1317 /// RegUses - Track which uses use which register candidates.
1318 RegUseTracker RegUses;
1320 void OptimizeShadowIV();
1321 bool FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse);
1322 ICmpInst *OptimizeMax(ICmpInst *Cond, IVStrideUse* &CondUse);
1323 void OptimizeLoopTermCond();
1325 void CollectInterestingTypesAndFactors();
1326 void CollectFixupsAndInitialFormulae();
1328 LSRFixup &getNewFixup() {
1329 Fixups.push_back(LSRFixup());
1330 return Fixups.back();
1333 // Support for sharing of LSRUses between LSRFixups.
1334 typedef DenseMap<std::pair<const SCEV *, LSRUse::KindType>,
1336 UseMapDenseMapInfo> UseMapTy;
1339 bool reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
1340 LSRUse::KindType Kind, const Type *AccessTy);
1342 std::pair<size_t, int64_t> getUse(const SCEV *&Expr,
1343 LSRUse::KindType Kind,
1344 const Type *AccessTy);
1346 void DeleteUse(LSRUse &LU);
1348 LSRUse *FindUseWithSimilarFormula(const Formula &F, const LSRUse &OrigLU);
1351 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1352 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1353 void CountRegisters(const Formula &F, size_t LUIdx);
1354 bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F);
1356 void CollectLoopInvariantFixupsAndFormulae();
1358 void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base,
1359 unsigned Depth = 0);
1360 void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base);
1361 void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
1362 void GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
1363 void GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base);
1364 void GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base);
1365 void GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base);
1366 void GenerateCrossUseConstantOffsets();
1367 void GenerateAllReuseFormulae();
1369 void FilterOutUndesirableDedicatedRegisters();
1371 size_t EstimateSearchSpaceComplexity() const;
1372 void NarrowSearchSpaceUsingHeuristics();
1374 void SolveRecurse(SmallVectorImpl<const Formula *> &Solution,
1376 SmallVectorImpl<const Formula *> &Workspace,
1377 const Cost &CurCost,
1378 const SmallPtrSet<const SCEV *, 16> &CurRegs,
1379 DenseSet<const SCEV *> &VisitedRegs) const;
1380 void Solve(SmallVectorImpl<const Formula *> &Solution) const;
1382 BasicBlock::iterator
1383 HoistInsertPosition(BasicBlock::iterator IP,
1384 const SmallVectorImpl<Instruction *> &Inputs) const;
1385 BasicBlock::iterator AdjustInsertPositionForExpand(BasicBlock::iterator IP,
1387 const LSRUse &LU) const;
1389 Value *Expand(const LSRFixup &LF,
1391 BasicBlock::iterator IP,
1392 SCEVExpander &Rewriter,
1393 SmallVectorImpl<WeakVH> &DeadInsts) const;
1394 void RewriteForPHI(PHINode *PN, const LSRFixup &LF,
1396 SCEVExpander &Rewriter,
1397 SmallVectorImpl<WeakVH> &DeadInsts,
1399 void Rewrite(const LSRFixup &LF,
1401 SCEVExpander &Rewriter,
1402 SmallVectorImpl<WeakVH> &DeadInsts,
1404 void ImplementSolution(const SmallVectorImpl<const Formula *> &Solution,
1407 LSRInstance(const TargetLowering *tli, Loop *l, Pass *P);
1409 bool getChanged() const { return Changed; }
1411 void print_factors_and_types(raw_ostream &OS) const;
1412 void print_fixups(raw_ostream &OS) const;
1413 void print_uses(raw_ostream &OS) const;
1414 void print(raw_ostream &OS) const;
1420 /// OptimizeShadowIV - If IV is used in a int-to-float cast
1421 /// inside the loop then try to eliminate the cast operation.
1422 void LSRInstance::OptimizeShadowIV() {
1423 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L);
1424 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
1427 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end();
1428 UI != E; /* empty */) {
1429 IVUsers::const_iterator CandidateUI = UI;
1431 Instruction *ShadowUse = CandidateUI->getUser();
1432 const Type *DestTy = NULL;
1434 /* If shadow use is a int->float cast then insert a second IV
1435 to eliminate this cast.
1437 for (unsigned i = 0; i < n; ++i)
1443 for (unsigned i = 0; i < n; ++i, ++d)
1446 if (UIToFPInst *UCast = dyn_cast<UIToFPInst>(CandidateUI->getUser()))
1447 DestTy = UCast->getDestTy();
1448 else if (SIToFPInst *SCast = dyn_cast<SIToFPInst>(CandidateUI->getUser()))
1449 DestTy = SCast->getDestTy();
1450 if (!DestTy) continue;
1453 // If target does not support DestTy natively then do not apply
1454 // this transformation.
1455 EVT DVT = TLI->getValueType(DestTy);
1456 if (!TLI->isTypeLegal(DVT)) continue;
1459 PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0));
1461 if (PH->getNumIncomingValues() != 2) continue;
1463 const Type *SrcTy = PH->getType();
1464 int Mantissa = DestTy->getFPMantissaWidth();
1465 if (Mantissa == -1) continue;
1466 if ((int)SE.getTypeSizeInBits(SrcTy) > Mantissa)
1469 unsigned Entry, Latch;
1470 if (PH->getIncomingBlock(0) == L->getLoopPreheader()) {
1478 ConstantInt *Init = dyn_cast<ConstantInt>(PH->getIncomingValue(Entry));
1479 if (!Init) continue;
1480 Constant *NewInit = ConstantFP::get(DestTy, Init->getZExtValue());
1482 BinaryOperator *Incr =
1483 dyn_cast<BinaryOperator>(PH->getIncomingValue(Latch));
1484 if (!Incr) continue;
1485 if (Incr->getOpcode() != Instruction::Add
1486 && Incr->getOpcode() != Instruction::Sub)
1489 /* Initialize new IV, double d = 0.0 in above example. */
1490 ConstantInt *C = NULL;
1491 if (Incr->getOperand(0) == PH)
1492 C = dyn_cast<ConstantInt>(Incr->getOperand(1));
1493 else if (Incr->getOperand(1) == PH)
1494 C = dyn_cast<ConstantInt>(Incr->getOperand(0));
1500 // Ignore negative constants, as the code below doesn't handle them
1501 // correctly. TODO: Remove this restriction.
1502 if (!C->getValue().isStrictlyPositive()) continue;
1504 /* Add new PHINode. */
1505 PHINode *NewPH = PHINode::Create(DestTy, "IV.S.", PH);
1507 /* create new increment. '++d' in above example. */
1508 Constant *CFP = ConstantFP::get(DestTy, C->getZExtValue());
1509 BinaryOperator *NewIncr =
1510 BinaryOperator::Create(Incr->getOpcode() == Instruction::Add ?
1511 Instruction::FAdd : Instruction::FSub,
1512 NewPH, CFP, "IV.S.next.", Incr);
1514 NewPH->addIncoming(NewInit, PH->getIncomingBlock(Entry));
1515 NewPH->addIncoming(NewIncr, PH->getIncomingBlock(Latch));
1517 /* Remove cast operation */
1518 ShadowUse->replaceAllUsesWith(NewPH);
1519 ShadowUse->eraseFromParent();
1525 /// FindIVUserForCond - If Cond has an operand that is an expression of an IV,
1526 /// set the IV user and stride information and return true, otherwise return
1528 bool LSRInstance::FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse) {
1529 for (IVUsers::iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI)
1530 if (UI->getUser() == Cond) {
1531 // NOTE: we could handle setcc instructions with multiple uses here, but
1532 // InstCombine does it as well for simple uses, it's not clear that it
1533 // occurs enough in real life to handle.
1540 /// OptimizeMax - Rewrite the loop's terminating condition if it uses
1541 /// a max computation.
1543 /// This is a narrow solution to a specific, but acute, problem. For loops
1549 /// } while (++i < n);
1551 /// the trip count isn't just 'n', because 'n' might not be positive. And
1552 /// unfortunately this can come up even for loops where the user didn't use
1553 /// a C do-while loop. For example, seemingly well-behaved top-test loops
1554 /// will commonly be lowered like this:
1560 /// } while (++i < n);
1563 /// and then it's possible for subsequent optimization to obscure the if
1564 /// test in such a way that indvars can't find it.
1566 /// When indvars can't find the if test in loops like this, it creates a
1567 /// max expression, which allows it to give the loop a canonical
1568 /// induction variable:
1571 /// max = n < 1 ? 1 : n;
1574 /// } while (++i != max);
1576 /// Canonical induction variables are necessary because the loop passes
1577 /// are designed around them. The most obvious example of this is the
1578 /// LoopInfo analysis, which doesn't remember trip count values. It
1579 /// expects to be able to rediscover the trip count each time it is
1580 /// needed, and it does this using a simple analysis that only succeeds if
1581 /// the loop has a canonical induction variable.
1583 /// However, when it comes time to generate code, the maximum operation
1584 /// can be quite costly, especially if it's inside of an outer loop.
1586 /// This function solves this problem by detecting this type of loop and
1587 /// rewriting their conditions from ICMP_NE back to ICMP_SLT, and deleting
1588 /// the instructions for the maximum computation.
1590 ICmpInst *LSRInstance::OptimizeMax(ICmpInst *Cond, IVStrideUse* &CondUse) {
1591 // Check that the loop matches the pattern we're looking for.
1592 if (Cond->getPredicate() != CmpInst::ICMP_EQ &&
1593 Cond->getPredicate() != CmpInst::ICMP_NE)
1596 SelectInst *Sel = dyn_cast<SelectInst>(Cond->getOperand(1));
1597 if (!Sel || !Sel->hasOneUse()) return Cond;
1599 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L);
1600 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
1602 const SCEV *One = SE.getConstant(BackedgeTakenCount->getType(), 1);
1604 // Add one to the backedge-taken count to get the trip count.
1605 const SCEV *IterationCount = SE.getAddExpr(One, BackedgeTakenCount);
1606 if (IterationCount != SE.getSCEV(Sel)) return Cond;
1608 // Check for a max calculation that matches the pattern. There's no check
1609 // for ICMP_ULE here because the comparison would be with zero, which
1610 // isn't interesting.
1611 CmpInst::Predicate Pred = ICmpInst::BAD_ICMP_PREDICATE;
1612 const SCEVNAryExpr *Max = 0;
1613 if (const SCEVSMaxExpr *S = dyn_cast<SCEVSMaxExpr>(BackedgeTakenCount)) {
1614 Pred = ICmpInst::ICMP_SLE;
1616 } else if (const SCEVSMaxExpr *S = dyn_cast<SCEVSMaxExpr>(IterationCount)) {
1617 Pred = ICmpInst::ICMP_SLT;
1619 } else if (const SCEVUMaxExpr *U = dyn_cast<SCEVUMaxExpr>(IterationCount)) {
1620 Pred = ICmpInst::ICMP_ULT;
1627 // To handle a max with more than two operands, this optimization would
1628 // require additional checking and setup.
1629 if (Max->getNumOperands() != 2)
1632 const SCEV *MaxLHS = Max->getOperand(0);
1633 const SCEV *MaxRHS = Max->getOperand(1);
1635 // ScalarEvolution canonicalizes constants to the left. For < and >, look
1636 // for a comparison with 1. For <= and >=, a comparison with zero.
1638 (ICmpInst::isTrueWhenEqual(Pred) ? !MaxLHS->isZero() : (MaxLHS != One)))
1641 // Check the relevant induction variable for conformance to
1643 const SCEV *IV = SE.getSCEV(Cond->getOperand(0));
1644 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV);
1645 if (!AR || !AR->isAffine() ||
1646 AR->getStart() != One ||
1647 AR->getStepRecurrence(SE) != One)
1650 assert(AR->getLoop() == L &&
1651 "Loop condition operand is an addrec in a different loop!");
1653 // Check the right operand of the select, and remember it, as it will
1654 // be used in the new comparison instruction.
1656 if (ICmpInst::isTrueWhenEqual(Pred)) {
1657 // Look for n+1, and grab n.
1658 if (AddOperator *BO = dyn_cast<AddOperator>(Sel->getOperand(1)))
1659 if (isa<ConstantInt>(BO->getOperand(1)) &&
1660 cast<ConstantInt>(BO->getOperand(1))->isOne() &&
1661 SE.getSCEV(BO->getOperand(0)) == MaxRHS)
1662 NewRHS = BO->getOperand(0);
1663 if (AddOperator *BO = dyn_cast<AddOperator>(Sel->getOperand(2)))
1664 if (isa<ConstantInt>(BO->getOperand(1)) &&
1665 cast<ConstantInt>(BO->getOperand(1))->isOne() &&
1666 SE.getSCEV(BO->getOperand(0)) == MaxRHS)
1667 NewRHS = BO->getOperand(0);
1670 } else if (SE.getSCEV(Sel->getOperand(1)) == MaxRHS)
1671 NewRHS = Sel->getOperand(1);
1672 else if (SE.getSCEV(Sel->getOperand(2)) == MaxRHS)
1673 NewRHS = Sel->getOperand(2);
1674 else if (const SCEVUnknown *SU = dyn_cast<SCEVUnknown>(MaxRHS))
1675 NewRHS = SU->getValue();
1677 // Max doesn't match expected pattern.
1680 // Determine the new comparison opcode. It may be signed or unsigned,
1681 // and the original comparison may be either equality or inequality.
1682 if (Cond->getPredicate() == CmpInst::ICMP_EQ)
1683 Pred = CmpInst::getInversePredicate(Pred);
1685 // Ok, everything looks ok to change the condition into an SLT or SGE and
1686 // delete the max calculation.
1688 new ICmpInst(Cond, Pred, Cond->getOperand(0), NewRHS, "scmp");
1690 // Delete the max calculation instructions.
1691 Cond->replaceAllUsesWith(NewCond);
1692 CondUse->setUser(NewCond);
1693 Instruction *Cmp = cast<Instruction>(Sel->getOperand(0));
1694 Cond->eraseFromParent();
1695 Sel->eraseFromParent();
1696 if (Cmp->use_empty())
1697 Cmp->eraseFromParent();
1701 /// OptimizeLoopTermCond - Change loop terminating condition to use the
1702 /// postinc iv when possible.
1704 LSRInstance::OptimizeLoopTermCond() {
1705 SmallPtrSet<Instruction *, 4> PostIncs;
1707 BasicBlock *LatchBlock = L->getLoopLatch();
1708 SmallVector<BasicBlock*, 8> ExitingBlocks;
1709 L->getExitingBlocks(ExitingBlocks);
1711 for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
1712 BasicBlock *ExitingBlock = ExitingBlocks[i];
1714 // Get the terminating condition for the loop if possible. If we
1715 // can, we want to change it to use a post-incremented version of its
1716 // induction variable, to allow coalescing the live ranges for the IV into
1717 // one register value.
1719 BranchInst *TermBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
1722 // FIXME: Overly conservative, termination condition could be an 'or' etc..
1723 if (TermBr->isUnconditional() || !isa<ICmpInst>(TermBr->getCondition()))
1726 // Search IVUsesByStride to find Cond's IVUse if there is one.
1727 IVStrideUse *CondUse = 0;
1728 ICmpInst *Cond = cast<ICmpInst>(TermBr->getCondition());
1729 if (!FindIVUserForCond(Cond, CondUse))
1732 // If the trip count is computed in terms of a max (due to ScalarEvolution
1733 // being unable to find a sufficient guard, for example), change the loop
1734 // comparison to use SLT or ULT instead of NE.
1735 // One consequence of doing this now is that it disrupts the count-down
1736 // optimization. That's not always a bad thing though, because in such
1737 // cases it may still be worthwhile to avoid a max.
1738 Cond = OptimizeMax(Cond, CondUse);
1740 // If this exiting block dominates the latch block, it may also use
1741 // the post-inc value if it won't be shared with other uses.
1742 // Check for dominance.
1743 if (!DT.dominates(ExitingBlock, LatchBlock))
1746 // Conservatively avoid trying to use the post-inc value in non-latch
1747 // exits if there may be pre-inc users in intervening blocks.
1748 if (LatchBlock != ExitingBlock)
1749 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI)
1750 // Test if the use is reachable from the exiting block. This dominator
1751 // query is a conservative approximation of reachability.
1752 if (&*UI != CondUse &&
1753 !DT.properlyDominates(UI->getUser()->getParent(), ExitingBlock)) {
1754 // Conservatively assume there may be reuse if the quotient of their
1755 // strides could be a legal scale.
1756 const SCEV *A = IU.getStride(*CondUse, L);
1757 const SCEV *B = IU.getStride(*UI, L);
1758 if (!A || !B) continue;
1759 if (SE.getTypeSizeInBits(A->getType()) !=
1760 SE.getTypeSizeInBits(B->getType())) {
1761 if (SE.getTypeSizeInBits(A->getType()) >
1762 SE.getTypeSizeInBits(B->getType()))
1763 B = SE.getSignExtendExpr(B, A->getType());
1765 A = SE.getSignExtendExpr(A, B->getType());
1767 if (const SCEVConstant *D =
1768 dyn_cast_or_null<SCEVConstant>(getExactSDiv(B, A, SE))) {
1769 const ConstantInt *C = D->getValue();
1770 // Stride of one or negative one can have reuse with non-addresses.
1771 if (C->isOne() || C->isAllOnesValue())
1772 goto decline_post_inc;
1773 // Avoid weird situations.
1774 if (C->getValue().getMinSignedBits() >= 64 ||
1775 C->getValue().isMinSignedValue())
1776 goto decline_post_inc;
1777 // Without TLI, assume that any stride might be valid, and so any
1778 // use might be shared.
1780 goto decline_post_inc;
1781 // Check for possible scaled-address reuse.
1782 const Type *AccessTy = getAccessType(UI->getUser());
1783 TargetLowering::AddrMode AM;
1784 AM.Scale = C->getSExtValue();
1785 if (TLI->isLegalAddressingMode(AM, AccessTy))
1786 goto decline_post_inc;
1787 AM.Scale = -AM.Scale;
1788 if (TLI->isLegalAddressingMode(AM, AccessTy))
1789 goto decline_post_inc;
1793 DEBUG(dbgs() << " Change loop exiting icmp to use postinc iv: "
1796 // It's possible for the setcc instruction to be anywhere in the loop, and
1797 // possible for it to have multiple users. If it is not immediately before
1798 // the exiting block branch, move it.
1799 if (&*++BasicBlock::iterator(Cond) != TermBr) {
1800 if (Cond->hasOneUse()) {
1801 Cond->moveBefore(TermBr);
1803 // Clone the terminating condition and insert into the loopend.
1804 ICmpInst *OldCond = Cond;
1805 Cond = cast<ICmpInst>(Cond->clone());
1806 Cond->setName(L->getHeader()->getName() + ".termcond");
1807 ExitingBlock->getInstList().insert(TermBr, Cond);
1809 // Clone the IVUse, as the old use still exists!
1810 CondUse = &IU.AddUser(Cond, CondUse->getOperandValToReplace());
1811 TermBr->replaceUsesOfWith(OldCond, Cond);
1815 // If we get to here, we know that we can transform the setcc instruction to
1816 // use the post-incremented version of the IV, allowing us to coalesce the
1817 // live ranges for the IV correctly.
1818 CondUse->transformToPostInc(L);
1821 PostIncs.insert(Cond);
1825 // Determine an insertion point for the loop induction variable increment. It
1826 // must dominate all the post-inc comparisons we just set up, and it must
1827 // dominate the loop latch edge.
1828 IVIncInsertPos = L->getLoopLatch()->getTerminator();
1829 for (SmallPtrSet<Instruction *, 4>::const_iterator I = PostIncs.begin(),
1830 E = PostIncs.end(); I != E; ++I) {
1832 DT.findNearestCommonDominator(IVIncInsertPos->getParent(),
1834 if (BB == (*I)->getParent())
1835 IVIncInsertPos = *I;
1836 else if (BB != IVIncInsertPos->getParent())
1837 IVIncInsertPos = BB->getTerminator();
1841 /// reconcileNewOffset - Determine if the given use can accomodate a fixup
1842 /// at the given offset and other details. If so, update the use and
1845 LSRInstance::reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
1846 LSRUse::KindType Kind, const Type *AccessTy) {
1847 int64_t NewMinOffset = LU.MinOffset;
1848 int64_t NewMaxOffset = LU.MaxOffset;
1849 const Type *NewAccessTy = AccessTy;
1851 // Check for a mismatched kind. It's tempting to collapse mismatched kinds to
1852 // something conservative, however this can pessimize in the case that one of
1853 // the uses will have all its uses outside the loop, for example.
1854 if (LU.Kind != Kind)
1856 // Conservatively assume HasBaseReg is true for now.
1857 if (NewOffset < LU.MinOffset) {
1858 if (!isAlwaysFoldable(LU.MaxOffset - NewOffset, 0, HasBaseReg,
1859 Kind, AccessTy, TLI))
1861 NewMinOffset = NewOffset;
1862 } else if (NewOffset > LU.MaxOffset) {
1863 if (!isAlwaysFoldable(NewOffset - LU.MinOffset, 0, HasBaseReg,
1864 Kind, AccessTy, TLI))
1866 NewMaxOffset = NewOffset;
1868 // Check for a mismatched access type, and fall back conservatively as needed.
1869 // TODO: Be less conservative when the type is similar and can use the same
1870 // addressing modes.
1871 if (Kind == LSRUse::Address && AccessTy != LU.AccessTy)
1872 NewAccessTy = Type::getVoidTy(AccessTy->getContext());
1875 LU.MinOffset = NewMinOffset;
1876 LU.MaxOffset = NewMaxOffset;
1877 LU.AccessTy = NewAccessTy;
1878 if (NewOffset != LU.Offsets.back())
1879 LU.Offsets.push_back(NewOffset);
1883 /// getUse - Return an LSRUse index and an offset value for a fixup which
1884 /// needs the given expression, with the given kind and optional access type.
1885 /// Either reuse an existing use or create a new one, as needed.
1886 std::pair<size_t, int64_t>
1887 LSRInstance::getUse(const SCEV *&Expr,
1888 LSRUse::KindType Kind, const Type *AccessTy) {
1889 const SCEV *Copy = Expr;
1890 int64_t Offset = ExtractImmediate(Expr, SE);
1892 // Basic uses can't accept any offset, for example.
1893 if (!isAlwaysFoldable(Offset, 0, /*HasBaseReg=*/true, Kind, AccessTy, TLI)) {
1898 std::pair<UseMapTy::iterator, bool> P =
1899 UseMap.insert(std::make_pair(std::make_pair(Expr, Kind), 0));
1901 // A use already existed with this base.
1902 size_t LUIdx = P.first->second;
1903 LSRUse &LU = Uses[LUIdx];
1904 if (reconcileNewOffset(LU, Offset, /*HasBaseReg=*/true, Kind, AccessTy))
1906 return std::make_pair(LUIdx, Offset);
1909 // Create a new use.
1910 size_t LUIdx = Uses.size();
1911 P.first->second = LUIdx;
1912 Uses.push_back(LSRUse(Kind, AccessTy));
1913 LSRUse &LU = Uses[LUIdx];
1915 // We don't need to track redundant offsets, but we don't need to go out
1916 // of our way here to avoid them.
1917 if (LU.Offsets.empty() || Offset != LU.Offsets.back())
1918 LU.Offsets.push_back(Offset);
1920 LU.MinOffset = Offset;
1921 LU.MaxOffset = Offset;
1922 return std::make_pair(LUIdx, Offset);
1925 /// DeleteUse - Delete the given use from the Uses list.
1926 void LSRInstance::DeleteUse(LSRUse &LU) {
1927 if (&LU != &Uses.back())
1928 std::swap(LU, Uses.back());
1932 /// FindUseWithFormula - Look for a use distinct from OrigLU which is has
1933 /// a formula that has the same registers as the given formula.
1935 LSRInstance::FindUseWithSimilarFormula(const Formula &OrigF,
1936 const LSRUse &OrigLU) {
1937 // Search all uses for the formula. This could be more clever. Ignore
1938 // ICmpZero uses because they may contain formulae generated by
1939 // GenerateICmpZeroScales, in which case adding fixup offsets may
1941 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
1942 LSRUse &LU = Uses[LUIdx];
1943 if (&LU != &OrigLU &&
1944 LU.Kind != LSRUse::ICmpZero &&
1945 LU.Kind == OrigLU.Kind && OrigLU.AccessTy == LU.AccessTy &&
1946 LU.WidestFixupType == OrigLU.WidestFixupType &&
1947 LU.HasFormulaWithSameRegs(OrigF)) {
1948 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(),
1949 E = LU.Formulae.end(); I != E; ++I) {
1950 const Formula &F = *I;
1951 if (F.BaseRegs == OrigF.BaseRegs &&
1952 F.ScaledReg == OrigF.ScaledReg &&
1953 F.AM.BaseGV == OrigF.AM.BaseGV &&
1954 F.AM.Scale == OrigF.AM.Scale &&
1956 if (F.AM.BaseOffs == 0)
1967 void LSRInstance::CollectInterestingTypesAndFactors() {
1968 SmallSetVector<const SCEV *, 4> Strides;
1970 // Collect interesting types and strides.
1971 SmallVector<const SCEV *, 4> Worklist;
1972 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) {
1973 const SCEV *Expr = IU.getExpr(*UI);
1975 // Collect interesting types.
1976 Types.insert(SE.getEffectiveSCEVType(Expr->getType()));
1978 // Add strides for mentioned loops.
1979 Worklist.push_back(Expr);
1981 const SCEV *S = Worklist.pop_back_val();
1982 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
1983 Strides.insert(AR->getStepRecurrence(SE));
1984 Worklist.push_back(AR->getStart());
1985 } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
1986 Worklist.append(Add->op_begin(), Add->op_end());
1988 } while (!Worklist.empty());
1991 // Compute interesting factors from the set of interesting strides.
1992 for (SmallSetVector<const SCEV *, 4>::const_iterator
1993 I = Strides.begin(), E = Strides.end(); I != E; ++I)
1994 for (SmallSetVector<const SCEV *, 4>::const_iterator NewStrideIter =
1995 llvm::next(I); NewStrideIter != E; ++NewStrideIter) {
1996 const SCEV *OldStride = *I;
1997 const SCEV *NewStride = *NewStrideIter;
1999 if (SE.getTypeSizeInBits(OldStride->getType()) !=
2000 SE.getTypeSizeInBits(NewStride->getType())) {
2001 if (SE.getTypeSizeInBits(OldStride->getType()) >
2002 SE.getTypeSizeInBits(NewStride->getType()))
2003 NewStride = SE.getSignExtendExpr(NewStride, OldStride->getType());
2005 OldStride = SE.getSignExtendExpr(OldStride, NewStride->getType());
2007 if (const SCEVConstant *Factor =
2008 dyn_cast_or_null<SCEVConstant>(getExactSDiv(NewStride, OldStride,
2010 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2011 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2012 } else if (const SCEVConstant *Factor =
2013 dyn_cast_or_null<SCEVConstant>(getExactSDiv(OldStride,
2016 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2017 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2021 // If all uses use the same type, don't bother looking for truncation-based
2023 if (Types.size() == 1)
2026 DEBUG(print_factors_and_types(dbgs()));
2029 void LSRInstance::CollectFixupsAndInitialFormulae() {
2030 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) {
2032 LSRFixup &LF = getNewFixup();
2033 LF.UserInst = UI->getUser();
2034 LF.OperandValToReplace = UI->getOperandValToReplace();
2035 LF.PostIncLoops = UI->getPostIncLoops();
2037 LSRUse::KindType Kind = LSRUse::Basic;
2038 const Type *AccessTy = 0;
2039 if (isAddressUse(LF.UserInst, LF.OperandValToReplace)) {
2040 Kind = LSRUse::Address;
2041 AccessTy = getAccessType(LF.UserInst);
2044 const SCEV *S = IU.getExpr(*UI);
2046 // Equality (== and !=) ICmps are special. We can rewrite (i == N) as
2047 // (N - i == 0), and this allows (N - i) to be the expression that we work
2048 // with rather than just N or i, so we can consider the register
2049 // requirements for both N and i at the same time. Limiting this code to
2050 // equality icmps is not a problem because all interesting loops use
2051 // equality icmps, thanks to IndVarSimplify.
2052 if (ICmpInst *CI = dyn_cast<ICmpInst>(LF.UserInst))
2053 if (CI->isEquality()) {
2054 // Swap the operands if needed to put the OperandValToReplace on the
2055 // left, for consistency.
2056 Value *NV = CI->getOperand(1);
2057 if (NV == LF.OperandValToReplace) {
2058 CI->setOperand(1, CI->getOperand(0));
2059 CI->setOperand(0, NV);
2060 NV = CI->getOperand(1);
2064 // x == y --> x - y == 0
2065 const SCEV *N = SE.getSCEV(NV);
2066 if (N->isLoopInvariant(L)) {
2067 Kind = LSRUse::ICmpZero;
2068 S = SE.getMinusSCEV(N, S);
2071 // -1 and the negations of all interesting strides (except the negation
2072 // of -1) are now also interesting.
2073 for (size_t i = 0, e = Factors.size(); i != e; ++i)
2074 if (Factors[i] != -1)
2075 Factors.insert(-(uint64_t)Factors[i]);
2079 // Set up the initial formula for this use.
2080 std::pair<size_t, int64_t> P = getUse(S, Kind, AccessTy);
2082 LF.Offset = P.second;
2083 LSRUse &LU = Uses[LF.LUIdx];
2084 LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L);
2085 if (!LU.WidestFixupType ||
2086 SE.getTypeSizeInBits(LU.WidestFixupType) <
2087 SE.getTypeSizeInBits(LF.OperandValToReplace->getType()))
2088 LU.WidestFixupType = LF.OperandValToReplace->getType();
2090 // If this is the first use of this LSRUse, give it a formula.
2091 if (LU.Formulae.empty()) {
2092 InsertInitialFormula(S, LU, LF.LUIdx);
2093 CountRegisters(LU.Formulae.back(), LF.LUIdx);
2097 DEBUG(print_fixups(dbgs()));
2100 /// InsertInitialFormula - Insert a formula for the given expression into
2101 /// the given use, separating out loop-variant portions from loop-invariant
2102 /// and loop-computable portions.
2104 LSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) {
2106 F.InitialMatch(S, L, SE, DT);
2107 bool Inserted = InsertFormula(LU, LUIdx, F);
2108 assert(Inserted && "Initial formula already exists!"); (void)Inserted;
2111 /// InsertSupplementalFormula - Insert a simple single-register formula for
2112 /// the given expression into the given use.
2114 LSRInstance::InsertSupplementalFormula(const SCEV *S,
2115 LSRUse &LU, size_t LUIdx) {
2117 F.BaseRegs.push_back(S);
2118 F.AM.HasBaseReg = true;
2119 bool Inserted = InsertFormula(LU, LUIdx, F);
2120 assert(Inserted && "Supplemental formula already exists!"); (void)Inserted;
2123 /// CountRegisters - Note which registers are used by the given formula,
2124 /// updating RegUses.
2125 void LSRInstance::CountRegisters(const Formula &F, size_t LUIdx) {
2127 RegUses.CountRegister(F.ScaledReg, LUIdx);
2128 for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(),
2129 E = F.BaseRegs.end(); I != E; ++I)
2130 RegUses.CountRegister(*I, LUIdx);
2133 /// InsertFormula - If the given formula has not yet been inserted, add it to
2134 /// the list, and return true. Return false otherwise.
2135 bool LSRInstance::InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) {
2136 if (!LU.InsertFormula(F))
2139 CountRegisters(F, LUIdx);
2143 /// CollectLoopInvariantFixupsAndFormulae - Check for other uses of
2144 /// loop-invariant values which we're tracking. These other uses will pin these
2145 /// values in registers, making them less profitable for elimination.
2146 /// TODO: This currently misses non-constant addrec step registers.
2147 /// TODO: Should this give more weight to users inside the loop?
2149 LSRInstance::CollectLoopInvariantFixupsAndFormulae() {
2150 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end());
2151 SmallPtrSet<const SCEV *, 8> Inserted;
2153 while (!Worklist.empty()) {
2154 const SCEV *S = Worklist.pop_back_val();
2156 if (const SCEVNAryExpr *N = dyn_cast<SCEVNAryExpr>(S))
2157 Worklist.append(N->op_begin(), N->op_end());
2158 else if (const SCEVCastExpr *C = dyn_cast<SCEVCastExpr>(S))
2159 Worklist.push_back(C->getOperand());
2160 else if (const SCEVUDivExpr *D = dyn_cast<SCEVUDivExpr>(S)) {
2161 Worklist.push_back(D->getLHS());
2162 Worklist.push_back(D->getRHS());
2163 } else if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) {
2164 if (!Inserted.insert(U)) continue;
2165 const Value *V = U->getValue();
2166 if (const Instruction *Inst = dyn_cast<Instruction>(V)) {
2167 // Look for instructions defined outside the loop.
2168 if (L->contains(Inst)) continue;
2169 } else if (isa<UndefValue>(V))
2170 // Undef doesn't have a live range, so it doesn't matter.
2172 for (Value::const_use_iterator UI = V->use_begin(), UE = V->use_end();
2174 const Instruction *UserInst = dyn_cast<Instruction>(*UI);
2175 // Ignore non-instructions.
2178 // Ignore instructions in other functions (as can happen with
2180 if (UserInst->getParent()->getParent() != L->getHeader()->getParent())
2182 // Ignore instructions not dominated by the loop.
2183 const BasicBlock *UseBB = !isa<PHINode>(UserInst) ?
2184 UserInst->getParent() :
2185 cast<PHINode>(UserInst)->getIncomingBlock(
2186 PHINode::getIncomingValueNumForOperand(UI.getOperandNo()));
2187 if (!DT.dominates(L->getHeader(), UseBB))
2189 // Ignore uses which are part of other SCEV expressions, to avoid
2190 // analyzing them multiple times.
2191 if (SE.isSCEVable(UserInst->getType())) {
2192 const SCEV *UserS = SE.getSCEV(const_cast<Instruction *>(UserInst));
2193 // If the user is a no-op, look through to its uses.
2194 if (!isa<SCEVUnknown>(UserS))
2198 SE.getUnknown(const_cast<Instruction *>(UserInst)));
2202 // Ignore icmp instructions which are already being analyzed.
2203 if (const ICmpInst *ICI = dyn_cast<ICmpInst>(UserInst)) {
2204 unsigned OtherIdx = !UI.getOperandNo();
2205 Value *OtherOp = const_cast<Value *>(ICI->getOperand(OtherIdx));
2206 if (SE.getSCEV(OtherOp)->hasComputableLoopEvolution(L))
2210 LSRFixup &LF = getNewFixup();
2211 LF.UserInst = const_cast<Instruction *>(UserInst);
2212 LF.OperandValToReplace = UI.getUse();
2213 std::pair<size_t, int64_t> P = getUse(S, LSRUse::Basic, 0);
2215 LF.Offset = P.second;
2216 LSRUse &LU = Uses[LF.LUIdx];
2217 LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L);
2218 if (!LU.WidestFixupType ||
2219 SE.getTypeSizeInBits(LU.WidestFixupType) <
2220 SE.getTypeSizeInBits(LF.OperandValToReplace->getType()))
2221 LU.WidestFixupType = LF.OperandValToReplace->getType();
2222 InsertSupplementalFormula(U, LU, LF.LUIdx);
2223 CountRegisters(LU.Formulae.back(), Uses.size() - 1);
2230 /// CollectSubexprs - Split S into subexpressions which can be pulled out into
2231 /// separate registers. If C is non-null, multiply each subexpression by C.
2232 static void CollectSubexprs(const SCEV *S, const SCEVConstant *C,
2233 SmallVectorImpl<const SCEV *> &Ops,
2235 ScalarEvolution &SE) {
2236 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
2237 // Break out add operands.
2238 for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end();
2240 CollectSubexprs(*I, C, Ops, L, SE);
2242 } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
2243 // Split a non-zero base out of an addrec.
2244 if (!AR->getStart()->isZero()) {
2245 CollectSubexprs(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0),
2246 AR->getStepRecurrence(SE),
2249 CollectSubexprs(AR->getStart(), C, Ops, L, SE);
2252 } else if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S)) {
2253 // Break (C * (a + b + c)) into C*a + C*b + C*c.
2254 if (Mul->getNumOperands() == 2)
2255 if (const SCEVConstant *Op0 =
2256 dyn_cast<SCEVConstant>(Mul->getOperand(0))) {
2257 CollectSubexprs(Mul->getOperand(1),
2258 C ? cast<SCEVConstant>(SE.getMulExpr(C, Op0)) : Op0,
2264 // Otherwise use the value itself, optionally with a scale applied.
2265 Ops.push_back(C ? SE.getMulExpr(C, S) : S);
2268 /// GenerateReassociations - Split out subexpressions from adds and the bases of
2270 void LSRInstance::GenerateReassociations(LSRUse &LU, unsigned LUIdx,
2273 // Arbitrarily cap recursion to protect compile time.
2274 if (Depth >= 3) return;
2276 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
2277 const SCEV *BaseReg = Base.BaseRegs[i];
2279 SmallVector<const SCEV *, 8> AddOps;
2280 CollectSubexprs(BaseReg, 0, AddOps, L, SE);
2282 if (AddOps.size() == 1) continue;
2284 for (SmallVectorImpl<const SCEV *>::const_iterator J = AddOps.begin(),
2285 JE = AddOps.end(); J != JE; ++J) {
2287 // Loop-variant "unknown" values are uninteresting; we won't be able to
2288 // do anything meaningful with them.
2289 if (isa<SCEVUnknown>(*J) && !(*J)->isLoopInvariant(L))
2292 // Don't pull a constant into a register if the constant could be folded
2293 // into an immediate field.
2294 if (isAlwaysFoldable(*J, LU.MinOffset, LU.MaxOffset,
2295 Base.getNumRegs() > 1,
2296 LU.Kind, LU.AccessTy, TLI, SE))
2299 // Collect all operands except *J.
2300 SmallVector<const SCEV *, 8> InnerAddOps
2301 (((const SmallVector<const SCEV *, 8> &)AddOps).begin(), J);
2303 (llvm::next(J), ((const SmallVector<const SCEV *, 8> &)AddOps).end());
2305 // Don't leave just a constant behind in a register if the constant could
2306 // be folded into an immediate field.
2307 if (InnerAddOps.size() == 1 &&
2308 isAlwaysFoldable(InnerAddOps[0], LU.MinOffset, LU.MaxOffset,
2309 Base.getNumRegs() > 1,
2310 LU.Kind, LU.AccessTy, TLI, SE))
2313 const SCEV *InnerSum = SE.getAddExpr(InnerAddOps);
2314 if (InnerSum->isZero())
2317 F.BaseRegs[i] = InnerSum;
2318 F.BaseRegs.push_back(*J);
2319 if (InsertFormula(LU, LUIdx, F))
2320 // If that formula hadn't been seen before, recurse to find more like
2322 GenerateReassociations(LU, LUIdx, LU.Formulae.back(), Depth+1);
2327 /// GenerateCombinations - Generate a formula consisting of all of the
2328 /// loop-dominating registers added into a single register.
2329 void LSRInstance::GenerateCombinations(LSRUse &LU, unsigned LUIdx,
2331 // This method is only interesting on a plurality of registers.
2332 if (Base.BaseRegs.size() <= 1) return;
2336 SmallVector<const SCEV *, 4> Ops;
2337 for (SmallVectorImpl<const SCEV *>::const_iterator
2338 I = Base.BaseRegs.begin(), E = Base.BaseRegs.end(); I != E; ++I) {
2339 const SCEV *BaseReg = *I;
2340 if (BaseReg->properlyDominates(L->getHeader(), &DT) &&
2341 !BaseReg->hasComputableLoopEvolution(L))
2342 Ops.push_back(BaseReg);
2344 F.BaseRegs.push_back(BaseReg);
2346 if (Ops.size() > 1) {
2347 const SCEV *Sum = SE.getAddExpr(Ops);
2348 // TODO: If Sum is zero, it probably means ScalarEvolution missed an
2349 // opportunity to fold something. For now, just ignore such cases
2350 // rather than proceed with zero in a register.
2351 if (!Sum->isZero()) {
2352 F.BaseRegs.push_back(Sum);
2353 (void)InsertFormula(LU, LUIdx, F);
2358 /// GenerateSymbolicOffsets - Generate reuse formulae using symbolic offsets.
2359 void LSRInstance::GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx,
2361 // We can't add a symbolic offset if the address already contains one.
2362 if (Base.AM.BaseGV) return;
2364 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
2365 const SCEV *G = Base.BaseRegs[i];
2366 GlobalValue *GV = ExtractSymbol(G, SE);
2367 if (G->isZero() || !GV)
2371 if (!isLegalUse(F.AM, LU.MinOffset, LU.MaxOffset,
2372 LU.Kind, LU.AccessTy, TLI))
2375 (void)InsertFormula(LU, LUIdx, F);
2379 /// GenerateConstantOffsets - Generate reuse formulae using symbolic offsets.
2380 void LSRInstance::GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx,
2382 // TODO: For now, just add the min and max offset, because it usually isn't
2383 // worthwhile looking at everything inbetween.
2384 SmallVector<int64_t, 2> Worklist;
2385 Worklist.push_back(LU.MinOffset);
2386 if (LU.MaxOffset != LU.MinOffset)
2387 Worklist.push_back(LU.MaxOffset);
2389 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
2390 const SCEV *G = Base.BaseRegs[i];
2392 for (SmallVectorImpl<int64_t>::const_iterator I = Worklist.begin(),
2393 E = Worklist.end(); I != E; ++I) {
2395 F.AM.BaseOffs = (uint64_t)Base.AM.BaseOffs - *I;
2396 if (isLegalUse(F.AM, LU.MinOffset - *I, LU.MaxOffset - *I,
2397 LU.Kind, LU.AccessTy, TLI)) {
2398 // Add the offset to the base register.
2399 const SCEV *NewG = SE.getAddExpr(SE.getConstant(G->getType(), *I), G);
2400 // If it cancelled out, drop the base register, otherwise update it.
2401 if (NewG->isZero()) {
2402 std::swap(F.BaseRegs[i], F.BaseRegs.back());
2403 F.BaseRegs.pop_back();
2405 F.BaseRegs[i] = NewG;
2407 (void)InsertFormula(LU, LUIdx, F);
2411 int64_t Imm = ExtractImmediate(G, SE);
2412 if (G->isZero() || Imm == 0)
2415 F.AM.BaseOffs = (uint64_t)F.AM.BaseOffs + Imm;
2416 if (!isLegalUse(F.AM, LU.MinOffset, LU.MaxOffset,
2417 LU.Kind, LU.AccessTy, TLI))
2420 (void)InsertFormula(LU, LUIdx, F);
2424 /// GenerateICmpZeroScales - For ICmpZero, check to see if we can scale up
2425 /// the comparison. For example, x == y -> x*c == y*c.
2426 void LSRInstance::GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx,
2428 if (LU.Kind != LSRUse::ICmpZero) return;
2430 // Determine the integer type for the base formula.
2431 const Type *IntTy = Base.getType();
2433 if (SE.getTypeSizeInBits(IntTy) > 64) return;
2435 // Don't do this if there is more than one offset.
2436 if (LU.MinOffset != LU.MaxOffset) return;
2438 assert(!Base.AM.BaseGV && "ICmpZero use is not legal!");
2440 // Check each interesting stride.
2441 for (SmallSetVector<int64_t, 8>::const_iterator
2442 I = Factors.begin(), E = Factors.end(); I != E; ++I) {
2443 int64_t Factor = *I;
2445 // Check that the multiplication doesn't overflow.
2446 if (Base.AM.BaseOffs == INT64_MIN && Factor == -1)
2448 int64_t NewBaseOffs = (uint64_t)Base.AM.BaseOffs * Factor;
2449 if (NewBaseOffs / Factor != Base.AM.BaseOffs)
2452 // Check that multiplying with the use offset doesn't overflow.
2453 int64_t Offset = LU.MinOffset;
2454 if (Offset == INT64_MIN && Factor == -1)
2456 Offset = (uint64_t)Offset * Factor;
2457 if (Offset / Factor != LU.MinOffset)
2461 F.AM.BaseOffs = NewBaseOffs;
2463 // Check that this scale is legal.
2464 if (!isLegalUse(F.AM, Offset, Offset, LU.Kind, LU.AccessTy, TLI))
2467 // Compensate for the use having MinOffset built into it.
2468 F.AM.BaseOffs = (uint64_t)F.AM.BaseOffs + Offset - LU.MinOffset;
2470 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
2472 // Check that multiplying with each base register doesn't overflow.
2473 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) {
2474 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS);
2475 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i])
2479 // Check that multiplying with the scaled register doesn't overflow.
2481 F.ScaledReg = SE.getMulExpr(F.ScaledReg, FactorS);
2482 if (getExactSDiv(F.ScaledReg, FactorS, SE) != Base.ScaledReg)
2486 // If we make it here and it's legal, add it.
2487 (void)InsertFormula(LU, LUIdx, F);
2492 /// GenerateScales - Generate stride factor reuse formulae by making use of
2493 /// scaled-offset address modes, for example.
2494 void LSRInstance::GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) {
2495 // Determine the integer type for the base formula.
2496 const Type *IntTy = Base.getType();
2499 // If this Formula already has a scaled register, we can't add another one.
2500 if (Base.AM.Scale != 0) return;
2502 // Check each interesting stride.
2503 for (SmallSetVector<int64_t, 8>::const_iterator
2504 I = Factors.begin(), E = Factors.end(); I != E; ++I) {
2505 int64_t Factor = *I;
2507 Base.AM.Scale = Factor;
2508 Base.AM.HasBaseReg = Base.BaseRegs.size() > 1;
2509 // Check whether this scale is going to be legal.
2510 if (!isLegalUse(Base.AM, LU.MinOffset, LU.MaxOffset,
2511 LU.Kind, LU.AccessTy, TLI)) {
2512 // As a special-case, handle special out-of-loop Basic users specially.
2513 // TODO: Reconsider this special case.
2514 if (LU.Kind == LSRUse::Basic &&
2515 isLegalUse(Base.AM, LU.MinOffset, LU.MaxOffset,
2516 LSRUse::Special, LU.AccessTy, TLI) &&
2517 LU.AllFixupsOutsideLoop)
2518 LU.Kind = LSRUse::Special;
2522 // For an ICmpZero, negating a solitary base register won't lead to
2524 if (LU.Kind == LSRUse::ICmpZero &&
2525 !Base.AM.HasBaseReg && Base.AM.BaseOffs == 0 && !Base.AM.BaseGV)
2527 // For each addrec base reg, apply the scale, if possible.
2528 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i)
2529 if (const SCEVAddRecExpr *AR =
2530 dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i])) {
2531 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
2532 if (FactorS->isZero())
2534 // Divide out the factor, ignoring high bits, since we'll be
2535 // scaling the value back up in the end.
2536 if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) {
2537 // TODO: This could be optimized to avoid all the copying.
2539 F.ScaledReg = Quotient;
2540 F.DeleteBaseReg(F.BaseRegs[i]);
2541 (void)InsertFormula(LU, LUIdx, F);
2547 /// GenerateTruncates - Generate reuse formulae from different IV types.
2548 void LSRInstance::GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) {
2549 // This requires TargetLowering to tell us which truncates are free.
2552 // Don't bother truncating symbolic values.
2553 if (Base.AM.BaseGV) return;
2555 // Determine the integer type for the base formula.
2556 const Type *DstTy = Base.getType();
2558 DstTy = SE.getEffectiveSCEVType(DstTy);
2560 for (SmallSetVector<const Type *, 4>::const_iterator
2561 I = Types.begin(), E = Types.end(); I != E; ++I) {
2562 const Type *SrcTy = *I;
2563 if (SrcTy != DstTy && TLI->isTruncateFree(SrcTy, DstTy)) {
2566 if (F.ScaledReg) F.ScaledReg = SE.getAnyExtendExpr(F.ScaledReg, *I);
2567 for (SmallVectorImpl<const SCEV *>::iterator J = F.BaseRegs.begin(),
2568 JE = F.BaseRegs.end(); J != JE; ++J)
2569 *J = SE.getAnyExtendExpr(*J, SrcTy);
2571 // TODO: This assumes we've done basic processing on all uses and
2572 // have an idea what the register usage is.
2573 if (!F.hasRegsUsedByUsesOtherThan(LUIdx, RegUses))
2576 (void)InsertFormula(LU, LUIdx, F);
2583 /// WorkItem - Helper class for GenerateCrossUseConstantOffsets. It's used to
2584 /// defer modifications so that the search phase doesn't have to worry about
2585 /// the data structures moving underneath it.
2589 const SCEV *OrigReg;
2591 WorkItem(size_t LI, int64_t I, const SCEV *R)
2592 : LUIdx(LI), Imm(I), OrigReg(R) {}
2594 void print(raw_ostream &OS) const;
2600 void WorkItem::print(raw_ostream &OS) const {
2601 OS << "in formulae referencing " << *OrigReg << " in use " << LUIdx
2602 << " , add offset " << Imm;
2605 void WorkItem::dump() const {
2606 print(errs()); errs() << '\n';
2609 /// GenerateCrossUseConstantOffsets - Look for registers which are a constant
2610 /// distance apart and try to form reuse opportunities between them.
2611 void LSRInstance::GenerateCrossUseConstantOffsets() {
2612 // Group the registers by their value without any added constant offset.
2613 typedef std::map<int64_t, const SCEV *> ImmMapTy;
2614 typedef DenseMap<const SCEV *, ImmMapTy> RegMapTy;
2616 DenseMap<const SCEV *, SmallBitVector> UsedByIndicesMap;
2617 SmallVector<const SCEV *, 8> Sequence;
2618 for (RegUseTracker::const_iterator I = RegUses.begin(), E = RegUses.end();
2620 const SCEV *Reg = *I;
2621 int64_t Imm = ExtractImmediate(Reg, SE);
2622 std::pair<RegMapTy::iterator, bool> Pair =
2623 Map.insert(std::make_pair(Reg, ImmMapTy()));
2625 Sequence.push_back(Reg);
2626 Pair.first->second.insert(std::make_pair(Imm, *I));
2627 UsedByIndicesMap[Reg] |= RegUses.getUsedByIndices(*I);
2630 // Now examine each set of registers with the same base value. Build up
2631 // a list of work to do and do the work in a separate step so that we're
2632 // not adding formulae and register counts while we're searching.
2633 SmallVector<WorkItem, 32> WorkItems;
2634 SmallSet<std::pair<size_t, int64_t>, 32> UniqueItems;
2635 for (SmallVectorImpl<const SCEV *>::const_iterator I = Sequence.begin(),
2636 E = Sequence.end(); I != E; ++I) {
2637 const SCEV *Reg = *I;
2638 const ImmMapTy &Imms = Map.find(Reg)->second;
2640 // It's not worthwhile looking for reuse if there's only one offset.
2641 if (Imms.size() == 1)
2644 DEBUG(dbgs() << "Generating cross-use offsets for " << *Reg << ':';
2645 for (ImmMapTy::const_iterator J = Imms.begin(), JE = Imms.end();
2647 dbgs() << ' ' << J->first;
2650 // Examine each offset.
2651 for (ImmMapTy::const_iterator J = Imms.begin(), JE = Imms.end();
2653 const SCEV *OrigReg = J->second;
2655 int64_t JImm = J->first;
2656 const SmallBitVector &UsedByIndices = RegUses.getUsedByIndices(OrigReg);
2658 if (!isa<SCEVConstant>(OrigReg) &&
2659 UsedByIndicesMap[Reg].count() == 1) {
2660 DEBUG(dbgs() << "Skipping cross-use reuse for " << *OrigReg << '\n');
2664 // Conservatively examine offsets between this orig reg a few selected
2666 ImmMapTy::const_iterator OtherImms[] = {
2667 Imms.begin(), prior(Imms.end()),
2668 Imms.upper_bound((Imms.begin()->first + prior(Imms.end())->first) / 2)
2670 for (size_t i = 0, e = array_lengthof(OtherImms); i != e; ++i) {
2671 ImmMapTy::const_iterator M = OtherImms[i];
2672 if (M == J || M == JE) continue;
2674 // Compute the difference between the two.
2675 int64_t Imm = (uint64_t)JImm - M->first;
2676 for (int LUIdx = UsedByIndices.find_first(); LUIdx != -1;
2677 LUIdx = UsedByIndices.find_next(LUIdx))
2678 // Make a memo of this use, offset, and register tuple.
2679 if (UniqueItems.insert(std::make_pair(LUIdx, Imm)))
2680 WorkItems.push_back(WorkItem(LUIdx, Imm, OrigReg));
2687 UsedByIndicesMap.clear();
2688 UniqueItems.clear();
2690 // Now iterate through the worklist and add new formulae.
2691 for (SmallVectorImpl<WorkItem>::const_iterator I = WorkItems.begin(),
2692 E = WorkItems.end(); I != E; ++I) {
2693 const WorkItem &WI = *I;
2694 size_t LUIdx = WI.LUIdx;
2695 LSRUse &LU = Uses[LUIdx];
2696 int64_t Imm = WI.Imm;
2697 const SCEV *OrigReg = WI.OrigReg;
2699 const Type *IntTy = SE.getEffectiveSCEVType(OrigReg->getType());
2700 const SCEV *NegImmS = SE.getSCEV(ConstantInt::get(IntTy, -(uint64_t)Imm));
2701 unsigned BitWidth = SE.getTypeSizeInBits(IntTy);
2703 // TODO: Use a more targeted data structure.
2704 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {
2705 const Formula &F = LU.Formulae[L];
2706 // Use the immediate in the scaled register.
2707 if (F.ScaledReg == OrigReg) {
2708 int64_t Offs = (uint64_t)F.AM.BaseOffs +
2709 Imm * (uint64_t)F.AM.Scale;
2710 // Don't create 50 + reg(-50).
2711 if (F.referencesReg(SE.getSCEV(
2712 ConstantInt::get(IntTy, -(uint64_t)Offs))))
2715 NewF.AM.BaseOffs = Offs;
2716 if (!isLegalUse(NewF.AM, LU.MinOffset, LU.MaxOffset,
2717 LU.Kind, LU.AccessTy, TLI))
2719 NewF.ScaledReg = SE.getAddExpr(NegImmS, NewF.ScaledReg);
2721 // If the new scale is a constant in a register, and adding the constant
2722 // value to the immediate would produce a value closer to zero than the
2723 // immediate itself, then the formula isn't worthwhile.
2724 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(NewF.ScaledReg))
2725 if (C->getValue()->getValue().isNegative() !=
2726 (NewF.AM.BaseOffs < 0) &&
2727 (C->getValue()->getValue().abs() * APInt(BitWidth, F.AM.Scale))
2728 .ule(abs64(NewF.AM.BaseOffs)))
2732 (void)InsertFormula(LU, LUIdx, NewF);
2734 // Use the immediate in a base register.
2735 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) {
2736 const SCEV *BaseReg = F.BaseRegs[N];
2737 if (BaseReg != OrigReg)
2740 NewF.AM.BaseOffs = (uint64_t)NewF.AM.BaseOffs + Imm;
2741 if (!isLegalUse(NewF.AM, LU.MinOffset, LU.MaxOffset,
2742 LU.Kind, LU.AccessTy, TLI))
2744 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg);
2746 // If the new formula has a constant in a register, and adding the
2747 // constant value to the immediate would produce a value closer to
2748 // zero than the immediate itself, then the formula isn't worthwhile.
2749 for (SmallVectorImpl<const SCEV *>::const_iterator
2750 J = NewF.BaseRegs.begin(), JE = NewF.BaseRegs.end();
2752 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(*J))
2753 if ((C->getValue()->getValue() + NewF.AM.BaseOffs).abs().slt(
2754 abs64(NewF.AM.BaseOffs)) &&
2755 (C->getValue()->getValue() +
2756 NewF.AM.BaseOffs).countTrailingZeros() >=
2757 CountTrailingZeros_64(NewF.AM.BaseOffs))
2761 (void)InsertFormula(LU, LUIdx, NewF);
2770 /// GenerateAllReuseFormulae - Generate formulae for each use.
2772 LSRInstance::GenerateAllReuseFormulae() {
2773 // This is split into multiple loops so that hasRegsUsedByUsesOtherThan
2774 // queries are more precise.
2775 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2776 LSRUse &LU = Uses[LUIdx];
2777 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2778 GenerateReassociations(LU, LUIdx, LU.Formulae[i]);
2779 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2780 GenerateCombinations(LU, LUIdx, LU.Formulae[i]);
2782 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2783 LSRUse &LU = Uses[LUIdx];
2784 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2785 GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);
2786 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2787 GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);
2788 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2789 GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);
2790 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2791 GenerateScales(LU, LUIdx, LU.Formulae[i]);
2793 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2794 LSRUse &LU = Uses[LUIdx];
2795 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2796 GenerateTruncates(LU, LUIdx, LU.Formulae[i]);
2799 GenerateCrossUseConstantOffsets();
2802 /// If their are multiple formulae with the same set of registers used
2803 /// by other uses, pick the best one and delete the others.
2804 void LSRInstance::FilterOutUndesirableDedicatedRegisters() {
2806 bool ChangedFormulae = false;
2809 // Collect the best formula for each unique set of shared registers. This
2810 // is reset for each use.
2811 typedef DenseMap<SmallVector<const SCEV *, 2>, size_t, UniquifierDenseMapInfo>
2813 BestFormulaeTy BestFormulae;
2815 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2816 LSRUse &LU = Uses[LUIdx];
2817 FormulaSorter Sorter(L, LU, SE, DT);
2818 DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs()); dbgs() << '\n');
2821 for (size_t FIdx = 0, NumForms = LU.Formulae.size();
2822 FIdx != NumForms; ++FIdx) {
2823 Formula &F = LU.Formulae[FIdx];
2825 SmallVector<const SCEV *, 2> Key;
2826 for (SmallVectorImpl<const SCEV *>::const_iterator J = F.BaseRegs.begin(),
2827 JE = F.BaseRegs.end(); J != JE; ++J) {
2828 const SCEV *Reg = *J;
2829 if (RegUses.isRegUsedByUsesOtherThan(Reg, LUIdx))
2833 RegUses.isRegUsedByUsesOtherThan(F.ScaledReg, LUIdx))
2834 Key.push_back(F.ScaledReg);
2835 // Unstable sort by host order ok, because this is only used for
2837 std::sort(Key.begin(), Key.end());
2839 std::pair<BestFormulaeTy::const_iterator, bool> P =
2840 BestFormulae.insert(std::make_pair(Key, FIdx));
2842 Formula &Best = LU.Formulae[P.first->second];
2843 if (Sorter.operator()(F, Best))
2845 DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
2847 " in favor of formula "; Best.print(dbgs());
2850 ChangedFormulae = true;
2852 LU.DeleteFormula(F);
2860 // Now that we've filtered out some formulae, recompute the Regs set.
2862 LU.RecomputeRegs(LUIdx, RegUses);
2864 // Reset this to prepare for the next use.
2865 BestFormulae.clear();
2868 DEBUG(if (ChangedFormulae) {
2870 "After filtering out undesirable candidates:\n";
2875 // This is a rough guess that seems to work fairly well.
2876 static const size_t ComplexityLimit = UINT16_MAX;
2878 /// EstimateSearchSpaceComplexity - Estimate the worst-case number of
2879 /// solutions the solver might have to consider. It almost never considers
2880 /// this many solutions because it prune the search space, but the pruning
2881 /// isn't always sufficient.
2882 size_t LSRInstance::EstimateSearchSpaceComplexity() const {
2884 for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
2885 E = Uses.end(); I != E; ++I) {
2886 size_t FSize = I->Formulae.size();
2887 if (FSize >= ComplexityLimit) {
2888 Power = ComplexityLimit;
2892 if (Power >= ComplexityLimit)
2898 /// NarrowSearchSpaceUsingHeuristics - If there are an extraordinary number of
2899 /// formulae to choose from, use some rough heuristics to prune down the number
2900 /// of formulae. This keeps the main solver from taking an extraordinary amount
2901 /// of time in some worst-case scenarios.
2902 void LSRInstance::NarrowSearchSpaceUsingHeuristics() {
2903 if (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
2904 DEBUG(dbgs() << "The search space is too complex.\n");
2906 DEBUG(dbgs() << "Narrowing the search space by eliminating formulae "
2907 "which use a superset of registers used by other "
2910 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2911 LSRUse &LU = Uses[LUIdx];
2913 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
2914 Formula &F = LU.Formulae[i];
2915 // Look for a formula with a constant or GV in a register. If the use
2916 // also has a formula with that same value in an immediate field,
2917 // delete the one that uses a register.
2918 for (SmallVectorImpl<const SCEV *>::const_iterator
2919 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) {
2920 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(*I)) {
2922 NewF.AM.BaseOffs += C->getValue()->getSExtValue();
2923 NewF.BaseRegs.erase(NewF.BaseRegs.begin() +
2924 (I - F.BaseRegs.begin()));
2925 if (LU.HasFormulaWithSameRegs(NewF)) {
2926 DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
2927 LU.DeleteFormula(F);
2933 } else if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(*I)) {
2934 if (GlobalValue *GV = dyn_cast<GlobalValue>(U->getValue()))
2937 NewF.AM.BaseGV = GV;
2938 NewF.BaseRegs.erase(NewF.BaseRegs.begin() +
2939 (I - F.BaseRegs.begin()));
2940 if (LU.HasFormulaWithSameRegs(NewF)) {
2941 DEBUG(dbgs() << " Deleting "; F.print(dbgs());
2943 LU.DeleteFormula(F);
2954 LU.RecomputeRegs(LUIdx, RegUses);
2957 DEBUG(dbgs() << "After pre-selection:\n";
2958 print_uses(dbgs()));
2961 if (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
2962 DEBUG(dbgs() << "The search space is too complex.\n");
2964 DEBUG(dbgs() << "Narrowing the search space by assuming that uses "
2965 "separated by a constant offset will use the same "
2968 // This is especially useful for unrolled loops.
2970 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2971 LSRUse &LU = Uses[LUIdx];
2972 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(),
2973 E = LU.Formulae.end(); I != E; ++I) {
2974 const Formula &F = *I;
2975 if (F.AM.BaseOffs != 0 && F.AM.Scale == 0) {
2976 if (LSRUse *LUThatHas = FindUseWithSimilarFormula(F, LU)) {
2977 if (reconcileNewOffset(*LUThatHas, F.AM.BaseOffs,
2978 /*HasBaseReg=*/false,
2979 LU.Kind, LU.AccessTy)) {
2980 DEBUG(dbgs() << " Deleting use "; LU.print(dbgs());
2983 LUThatHas->AllFixupsOutsideLoop &= LU.AllFixupsOutsideLoop;
2985 // Delete formulae from the new use which are no longer legal.
2987 for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {
2988 Formula &F = LUThatHas->Formulae[i];
2989 if (!isLegalUse(F.AM,
2990 LUThatHas->MinOffset, LUThatHas->MaxOffset,
2991 LUThatHas->Kind, LUThatHas->AccessTy, TLI)) {
2992 DEBUG(dbgs() << " Deleting "; F.print(dbgs());
2994 LUThatHas->DeleteFormula(F);
3001 LUThatHas->RecomputeRegs(LUThatHas - &Uses.front(), RegUses);
3003 // Update the relocs to reference the new use.
3004 for (SmallVectorImpl<LSRFixup>::iterator I = Fixups.begin(),
3005 E = Fixups.end(); I != E; ++I) {
3006 LSRFixup &Fixup = *I;
3007 if (Fixup.LUIdx == LUIdx) {
3008 Fixup.LUIdx = LUThatHas - &Uses.front();
3009 Fixup.Offset += F.AM.BaseOffs;
3010 DEBUG(dbgs() << "New fixup has offset "
3011 << Fixup.Offset << '\n');
3013 if (Fixup.LUIdx == NumUses-1)
3014 Fixup.LUIdx = LUIdx;
3017 // Delete the old use.
3028 DEBUG(dbgs() << "After pre-selection:\n";
3029 print_uses(dbgs()));
3032 // With all other options exhausted, loop until the system is simple
3033 // enough to handle.
3034 SmallPtrSet<const SCEV *, 4> Taken;
3035 while (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
3036 // Ok, we have too many of formulae on our hands to conveniently handle.
3037 // Use a rough heuristic to thin out the list.
3038 DEBUG(dbgs() << "The search space is too complex.\n");
3040 // Pick the register which is used by the most LSRUses, which is likely
3041 // to be a good reuse register candidate.
3042 const SCEV *Best = 0;
3043 unsigned BestNum = 0;
3044 for (RegUseTracker::const_iterator I = RegUses.begin(), E = RegUses.end();
3046 const SCEV *Reg = *I;
3047 if (Taken.count(Reg))
3052 unsigned Count = RegUses.getUsedByIndices(Reg).count();
3053 if (Count > BestNum) {
3060 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
3061 << " will yield profitable reuse.\n");
3064 // In any use with formulae which references this register, delete formulae
3065 // which don't reference it.
3066 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3067 LSRUse &LU = Uses[LUIdx];
3068 if (!LU.Regs.count(Best)) continue;
3071 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
3072 Formula &F = LU.Formulae[i];
3073 if (!F.referencesReg(Best)) {
3074 DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
3075 LU.DeleteFormula(F);
3079 assert(e != 0 && "Use has no formulae left! Is Regs inconsistent?");
3085 LU.RecomputeRegs(LUIdx, RegUses);
3088 DEBUG(dbgs() << "After pre-selection:\n";
3089 print_uses(dbgs()));
3093 /// SolveRecurse - This is the recursive solver.
3094 void LSRInstance::SolveRecurse(SmallVectorImpl<const Formula *> &Solution,
3096 SmallVectorImpl<const Formula *> &Workspace,
3097 const Cost &CurCost,
3098 const SmallPtrSet<const SCEV *, 16> &CurRegs,
3099 DenseSet<const SCEV *> &VisitedRegs) const {
3102 // - use more aggressive filtering
3103 // - sort the formula so that the most profitable solutions are found first
3104 // - sort the uses too
3106 // - don't compute a cost, and then compare. compare while computing a cost
3108 // - track register sets with SmallBitVector
3110 const LSRUse &LU = Uses[Workspace.size()];
3112 // If this use references any register that's already a part of the
3113 // in-progress solution, consider it a requirement that a formula must
3114 // reference that register in order to be considered. This prunes out
3115 // unprofitable searching.
3116 SmallSetVector<const SCEV *, 4> ReqRegs;
3117 for (SmallPtrSet<const SCEV *, 16>::const_iterator I = CurRegs.begin(),
3118 E = CurRegs.end(); I != E; ++I)
3119 if (LU.Regs.count(*I))
3122 bool AnySatisfiedReqRegs = false;
3123 SmallPtrSet<const SCEV *, 16> NewRegs;
3126 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(),
3127 E = LU.Formulae.end(); I != E; ++I) {
3128 const Formula &F = *I;
3130 // Ignore formulae which do not use any of the required registers.
3131 for (SmallSetVector<const SCEV *, 4>::const_iterator J = ReqRegs.begin(),
3132 JE = ReqRegs.end(); J != JE; ++J) {
3133 const SCEV *Reg = *J;
3134 if ((!F.ScaledReg || F.ScaledReg != Reg) &&
3135 std::find(F.BaseRegs.begin(), F.BaseRegs.end(), Reg) ==
3139 AnySatisfiedReqRegs = true;
3141 // Evaluate the cost of the current formula. If it's already worse than
3142 // the current best, prune the search at that point.
3145 NewCost.RateFormula(F, NewRegs, VisitedRegs, L, LU.Offsets, SE, DT);
3146 if (NewCost < SolutionCost) {
3147 Workspace.push_back(&F);
3148 if (Workspace.size() != Uses.size()) {
3149 SolveRecurse(Solution, SolutionCost, Workspace, NewCost,
3150 NewRegs, VisitedRegs);
3151 if (F.getNumRegs() == 1 && Workspace.size() == 1)
3152 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]);
3154 DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
3155 dbgs() << ". Regs:";
3156 for (SmallPtrSet<const SCEV *, 16>::const_iterator
3157 I = NewRegs.begin(), E = NewRegs.end(); I != E; ++I)
3158 dbgs() << ' ' << **I;
3161 SolutionCost = NewCost;
3162 Solution = Workspace;
3164 Workspace.pop_back();
3169 // If none of the formulae had all of the required registers, relax the
3170 // constraint so that we don't exclude all formulae.
3171 if (!AnySatisfiedReqRegs) {
3172 assert(!ReqRegs.empty() && "Solver failed even without required registers");
3178 /// Solve - Choose one formula from each use. Return the results in the given
3179 /// Solution vector.
3180 void LSRInstance::Solve(SmallVectorImpl<const Formula *> &Solution) const {
3181 SmallVector<const Formula *, 8> Workspace;
3183 SolutionCost.Loose();
3185 SmallPtrSet<const SCEV *, 16> CurRegs;
3186 DenseSet<const SCEV *> VisitedRegs;
3187 Workspace.reserve(Uses.size());
3189 // SolveRecurse does all the work.
3190 SolveRecurse(Solution, SolutionCost, Workspace, CurCost,
3191 CurRegs, VisitedRegs);
3193 // Ok, we've now made all our decisions.
3194 DEBUG(dbgs() << "\n"
3195 "The chosen solution requires "; SolutionCost.print(dbgs());
3197 for (size_t i = 0, e = Uses.size(); i != e; ++i) {
3199 Uses[i].print(dbgs());
3202 Solution[i]->print(dbgs());
3206 assert(Solution.size() == Uses.size() && "Malformed solution!");
3209 /// HoistInsertPosition - Helper for AdjustInsertPositionForExpand. Climb up
3210 /// the dominator tree far as we can go while still being dominated by the
3211 /// input positions. This helps canonicalize the insert position, which
3212 /// encourages sharing.
3213 BasicBlock::iterator
3214 LSRInstance::HoistInsertPosition(BasicBlock::iterator IP,
3215 const SmallVectorImpl<Instruction *> &Inputs)
3218 const Loop *IPLoop = LI.getLoopFor(IP->getParent());
3219 unsigned IPLoopDepth = IPLoop ? IPLoop->getLoopDepth() : 0;
3222 for (DomTreeNode *Rung = DT.getNode(IP->getParent()); ; ) {
3223 if (!Rung) return IP;
3224 Rung = Rung->getIDom();
3225 if (!Rung) return IP;
3226 IDom = Rung->getBlock();
3228 // Don't climb into a loop though.
3229 const Loop *IDomLoop = LI.getLoopFor(IDom);
3230 unsigned IDomDepth = IDomLoop ? IDomLoop->getLoopDepth() : 0;
3231 if (IDomDepth <= IPLoopDepth &&
3232 (IDomDepth != IPLoopDepth || IDomLoop == IPLoop))
3236 bool AllDominate = true;
3237 Instruction *BetterPos = 0;
3238 Instruction *Tentative = IDom->getTerminator();
3239 for (SmallVectorImpl<Instruction *>::const_iterator I = Inputs.begin(),
3240 E = Inputs.end(); I != E; ++I) {
3241 Instruction *Inst = *I;
3242 if (Inst == Tentative || !DT.dominates(Inst, Tentative)) {
3243 AllDominate = false;
3246 // Attempt to find an insert position in the middle of the block,
3247 // instead of at the end, so that it can be used for other expansions.
3248 if (IDom == Inst->getParent() &&
3249 (!BetterPos || DT.dominates(BetterPos, Inst)))
3250 BetterPos = llvm::next(BasicBlock::iterator(Inst));
3263 /// AdjustInsertPositionForExpand - Determine an input position which will be
3264 /// dominated by the operands and which will dominate the result.
3265 BasicBlock::iterator
3266 LSRInstance::AdjustInsertPositionForExpand(BasicBlock::iterator IP,
3268 const LSRUse &LU) const {
3269 // Collect some instructions which must be dominated by the
3270 // expanding replacement. These must be dominated by any operands that
3271 // will be required in the expansion.
3272 SmallVector<Instruction *, 4> Inputs;
3273 if (Instruction *I = dyn_cast<Instruction>(LF.OperandValToReplace))
3274 Inputs.push_back(I);
3275 if (LU.Kind == LSRUse::ICmpZero)
3276 if (Instruction *I =
3277 dyn_cast<Instruction>(cast<ICmpInst>(LF.UserInst)->getOperand(1)))
3278 Inputs.push_back(I);
3279 if (LF.PostIncLoops.count(L)) {
3280 if (LF.isUseFullyOutsideLoop(L))
3281 Inputs.push_back(L->getLoopLatch()->getTerminator());
3283 Inputs.push_back(IVIncInsertPos);
3285 // The expansion must also be dominated by the increment positions of any
3286 // loops it for which it is using post-inc mode.
3287 for (PostIncLoopSet::const_iterator I = LF.PostIncLoops.begin(),
3288 E = LF.PostIncLoops.end(); I != E; ++I) {
3289 const Loop *PIL = *I;
3290 if (PIL == L) continue;
3292 // Be dominated by the loop exit.
3293 SmallVector<BasicBlock *, 4> ExitingBlocks;
3294 PIL->getExitingBlocks(ExitingBlocks);
3295 if (!ExitingBlocks.empty()) {
3296 BasicBlock *BB = ExitingBlocks[0];
3297 for (unsigned i = 1, e = ExitingBlocks.size(); i != e; ++i)
3298 BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]);
3299 Inputs.push_back(BB->getTerminator());
3303 // Then, climb up the immediate dominator tree as far as we can go while
3304 // still being dominated by the input positions.
3305 IP = HoistInsertPosition(IP, Inputs);
3307 // Don't insert instructions before PHI nodes.
3308 while (isa<PHINode>(IP)) ++IP;
3310 // Ignore debug intrinsics.
3311 while (isa<DbgInfoIntrinsic>(IP)) ++IP;
3316 /// Expand - Emit instructions for the leading candidate expression for this
3317 /// LSRUse (this is called "expanding").
3318 Value *LSRInstance::Expand(const LSRFixup &LF,
3320 BasicBlock::iterator IP,
3321 SCEVExpander &Rewriter,
3322 SmallVectorImpl<WeakVH> &DeadInsts) const {
3323 const LSRUse &LU = Uses[LF.LUIdx];
3325 // Determine an input position which will be dominated by the operands and
3326 // which will dominate the result.
3327 IP = AdjustInsertPositionForExpand(IP, LF, LU);
3329 // Inform the Rewriter if we have a post-increment use, so that it can
3330 // perform an advantageous expansion.
3331 Rewriter.setPostInc(LF.PostIncLoops);
3333 // This is the type that the user actually needs.
3334 const Type *OpTy = LF.OperandValToReplace->getType();
3335 // This will be the type that we'll initially expand to.
3336 const Type *Ty = F.getType();
3338 // No type known; just expand directly to the ultimate type.
3340 else if (SE.getEffectiveSCEVType(Ty) == SE.getEffectiveSCEVType(OpTy))
3341 // Expand directly to the ultimate type if it's the right size.
3343 // This is the type to do integer arithmetic in.
3344 const Type *IntTy = SE.getEffectiveSCEVType(Ty);
3346 // Build up a list of operands to add together to form the full base.
3347 SmallVector<const SCEV *, 8> Ops;
3349 // Expand the BaseRegs portion.
3350 for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(),
3351 E = F.BaseRegs.end(); I != E; ++I) {
3352 const SCEV *Reg = *I;
3353 assert(!Reg->isZero() && "Zero allocated in a base register!");
3355 // If we're expanding for a post-inc user, make the post-inc adjustment.
3356 PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops);
3357 Reg = TransformForPostIncUse(Denormalize, Reg,
3358 LF.UserInst, LF.OperandValToReplace,
3361 Ops.push_back(SE.getUnknown(Rewriter.expandCodeFor(Reg, 0, IP)));
3364 // Flush the operand list to suppress SCEVExpander hoisting.
3366 Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP);
3368 Ops.push_back(SE.getUnknown(FullV));
3371 // Expand the ScaledReg portion.
3372 Value *ICmpScaledV = 0;
3373 if (F.AM.Scale != 0) {
3374 const SCEV *ScaledS = F.ScaledReg;
3376 // If we're expanding for a post-inc user, make the post-inc adjustment.
3377 PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops);
3378 ScaledS = TransformForPostIncUse(Denormalize, ScaledS,
3379 LF.UserInst, LF.OperandValToReplace,
3382 if (LU.Kind == LSRUse::ICmpZero) {
3383 // An interesting way of "folding" with an icmp is to use a negated
3384 // scale, which we'll implement by inserting it into the other operand
3386 assert(F.AM.Scale == -1 &&
3387 "The only scale supported by ICmpZero uses is -1!");
3388 ICmpScaledV = Rewriter.expandCodeFor(ScaledS, 0, IP);
3390 // Otherwise just expand the scaled register and an explicit scale,
3391 // which is expected to be matched as part of the address.
3392 ScaledS = SE.getUnknown(Rewriter.expandCodeFor(ScaledS, 0, IP));
3393 ScaledS = SE.getMulExpr(ScaledS,
3394 SE.getConstant(ScaledS->getType(), F.AM.Scale));
3395 Ops.push_back(ScaledS);
3397 // Flush the operand list to suppress SCEVExpander hoisting.
3398 Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP);
3400 Ops.push_back(SE.getUnknown(FullV));
3404 // Expand the GV portion.
3406 Ops.push_back(SE.getUnknown(F.AM.BaseGV));
3408 // Flush the operand list to suppress SCEVExpander hoisting.
3409 Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP);
3411 Ops.push_back(SE.getUnknown(FullV));
3414 // Expand the immediate portion.
3415 int64_t Offset = (uint64_t)F.AM.BaseOffs + LF.Offset;
3417 if (LU.Kind == LSRUse::ICmpZero) {
3418 // The other interesting way of "folding" with an ICmpZero is to use a
3419 // negated immediate.
3421 ICmpScaledV = ConstantInt::get(IntTy, -Offset);
3423 Ops.push_back(SE.getUnknown(ICmpScaledV));
3424 ICmpScaledV = ConstantInt::get(IntTy, Offset);
3427 // Just add the immediate values. These again are expected to be matched
3428 // as part of the address.
3429 Ops.push_back(SE.getUnknown(ConstantInt::getSigned(IntTy, Offset)));
3433 // Emit instructions summing all the operands.
3434 const SCEV *FullS = Ops.empty() ?
3435 SE.getConstant(IntTy, 0) :
3437 Value *FullV = Rewriter.expandCodeFor(FullS, Ty, IP);
3439 // We're done expanding now, so reset the rewriter.
3440 Rewriter.clearPostInc();
3442 // An ICmpZero Formula represents an ICmp which we're handling as a
3443 // comparison against zero. Now that we've expanded an expression for that
3444 // form, update the ICmp's other operand.
3445 if (LU.Kind == LSRUse::ICmpZero) {
3446 ICmpInst *CI = cast<ICmpInst>(LF.UserInst);
3447 DeadInsts.push_back(CI->getOperand(1));
3448 assert(!F.AM.BaseGV && "ICmp does not support folding a global value and "
3449 "a scale at the same time!");
3450 if (F.AM.Scale == -1) {
3451 if (ICmpScaledV->getType() != OpTy) {
3453 CastInst::Create(CastInst::getCastOpcode(ICmpScaledV, false,
3455 ICmpScaledV, OpTy, "tmp", CI);
3458 CI->setOperand(1, ICmpScaledV);
3460 assert(F.AM.Scale == 0 &&
3461 "ICmp does not support folding a global value and "
3462 "a scale at the same time!");
3463 Constant *C = ConstantInt::getSigned(SE.getEffectiveSCEVType(OpTy),
3465 if (C->getType() != OpTy)
3466 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
3470 CI->setOperand(1, C);
3477 /// RewriteForPHI - Helper for Rewrite. PHI nodes are special because the use
3478 /// of their operands effectively happens in their predecessor blocks, so the
3479 /// expression may need to be expanded in multiple places.
3480 void LSRInstance::RewriteForPHI(PHINode *PN,
3483 SCEVExpander &Rewriter,
3484 SmallVectorImpl<WeakVH> &DeadInsts,
3486 DenseMap<BasicBlock *, Value *> Inserted;
3487 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
3488 if (PN->getIncomingValue(i) == LF.OperandValToReplace) {
3489 BasicBlock *BB = PN->getIncomingBlock(i);
3491 // If this is a critical edge, split the edge so that we do not insert
3492 // the code on all predecessor/successor paths. We do this unless this
3493 // is the canonical backedge for this loop, which complicates post-inc
3495 if (e != 1 && BB->getTerminator()->getNumSuccessors() > 1 &&
3496 !isa<IndirectBrInst>(BB->getTerminator()) &&
3497 (PN->getParent() != L->getHeader() || !L->contains(BB))) {
3498 // Split the critical edge.
3499 BasicBlock *NewBB = SplitCriticalEdge(BB, PN->getParent(), P);
3501 // If PN is outside of the loop and BB is in the loop, we want to
3502 // move the block to be immediately before the PHI block, not
3503 // immediately after BB.
3504 if (L->contains(BB) && !L->contains(PN))
3505 NewBB->moveBefore(PN->getParent());
3507 // Splitting the edge can reduce the number of PHI entries we have.
3508 e = PN->getNumIncomingValues();
3510 i = PN->getBasicBlockIndex(BB);
3513 std::pair<DenseMap<BasicBlock *, Value *>::iterator, bool> Pair =
3514 Inserted.insert(std::make_pair(BB, static_cast<Value *>(0)));
3516 PN->setIncomingValue(i, Pair.first->second);
3518 Value *FullV = Expand(LF, F, BB->getTerminator(), Rewriter, DeadInsts);
3520 // If this is reuse-by-noop-cast, insert the noop cast.
3521 const Type *OpTy = LF.OperandValToReplace->getType();
3522 if (FullV->getType() != OpTy)
3524 CastInst::Create(CastInst::getCastOpcode(FullV, false,
3526 FullV, LF.OperandValToReplace->getType(),
3527 "tmp", BB->getTerminator());
3529 PN->setIncomingValue(i, FullV);
3530 Pair.first->second = FullV;
3535 /// Rewrite - Emit instructions for the leading candidate expression for this
3536 /// LSRUse (this is called "expanding"), and update the UserInst to reference
3537 /// the newly expanded value.
3538 void LSRInstance::Rewrite(const LSRFixup &LF,
3540 SCEVExpander &Rewriter,
3541 SmallVectorImpl<WeakVH> &DeadInsts,
3543 // First, find an insertion point that dominates UserInst. For PHI nodes,
3544 // find the nearest block which dominates all the relevant uses.
3545 if (PHINode *PN = dyn_cast<PHINode>(LF.UserInst)) {
3546 RewriteForPHI(PN, LF, F, Rewriter, DeadInsts, P);
3548 Value *FullV = Expand(LF, F, LF.UserInst, Rewriter, DeadInsts);
3550 // If this is reuse-by-noop-cast, insert the noop cast.
3551 const Type *OpTy = LF.OperandValToReplace->getType();
3552 if (FullV->getType() != OpTy) {
3554 CastInst::Create(CastInst::getCastOpcode(FullV, false, OpTy, false),
3555 FullV, OpTy, "tmp", LF.UserInst);
3559 // Update the user. ICmpZero is handled specially here (for now) because
3560 // Expand may have updated one of the operands of the icmp already, and
3561 // its new value may happen to be equal to LF.OperandValToReplace, in
3562 // which case doing replaceUsesOfWith leads to replacing both operands
3563 // with the same value. TODO: Reorganize this.
3564 if (Uses[LF.LUIdx].Kind == LSRUse::ICmpZero)
3565 LF.UserInst->setOperand(0, FullV);
3567 LF.UserInst->replaceUsesOfWith(LF.OperandValToReplace, FullV);
3570 DeadInsts.push_back(LF.OperandValToReplace);
3573 /// ImplementSolution - Rewrite all the fixup locations with new values,
3574 /// following the chosen solution.
3576 LSRInstance::ImplementSolution(const SmallVectorImpl<const Formula *> &Solution,
3578 // Keep track of instructions we may have made dead, so that
3579 // we can remove them after we are done working.
3580 SmallVector<WeakVH, 16> DeadInsts;
3582 SCEVExpander Rewriter(SE);
3583 Rewriter.disableCanonicalMode();
3584 Rewriter.setIVIncInsertPos(L, IVIncInsertPos);
3586 // Expand the new value definitions and update the users.
3587 for (SmallVectorImpl<LSRFixup>::const_iterator I = Fixups.begin(),
3588 E = Fixups.end(); I != E; ++I) {
3589 const LSRFixup &Fixup = *I;
3591 Rewrite(Fixup, *Solution[Fixup.LUIdx], Rewriter, DeadInsts, P);
3596 // Clean up after ourselves. This must be done before deleting any
3600 Changed |= DeleteTriviallyDeadInstructions(DeadInsts);
3603 LSRInstance::LSRInstance(const TargetLowering *tli, Loop *l, Pass *P)
3604 : IU(P->getAnalysis<IVUsers>()),
3605 SE(P->getAnalysis<ScalarEvolution>()),
3606 DT(P->getAnalysis<DominatorTree>()),
3607 LI(P->getAnalysis<LoopInfo>()),
3608 TLI(tli), L(l), Changed(false), IVIncInsertPos(0) {
3610 // If LoopSimplify form is not available, stay out of trouble.
3611 if (!L->isLoopSimplifyForm()) return;
3613 // If there's no interesting work to be done, bail early.
3614 if (IU.empty()) return;
3616 DEBUG(dbgs() << "\nLSR on loop ";
3617 WriteAsOperand(dbgs(), L->getHeader(), /*PrintType=*/false);
3620 // First, perform some low-level loop optimizations.
3622 OptimizeLoopTermCond();
3624 // Start collecting data and preparing for the solver.
3625 CollectInterestingTypesAndFactors();
3626 CollectFixupsAndInitialFormulae();
3627 CollectLoopInvariantFixupsAndFormulae();
3629 DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
3630 print_uses(dbgs()));
3632 // Now use the reuse data to generate a bunch of interesting ways
3633 // to formulate the values needed for the uses.
3634 GenerateAllReuseFormulae();
3636 DEBUG(dbgs() << "\n"
3637 "After generating reuse formulae:\n";
3638 print_uses(dbgs()));
3640 FilterOutUndesirableDedicatedRegisters();
3641 NarrowSearchSpaceUsingHeuristics();
3643 SmallVector<const Formula *, 8> Solution;
3646 // Release memory that is no longer needed.
3652 // Formulae should be legal.
3653 for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
3654 E = Uses.end(); I != E; ++I) {
3655 const LSRUse &LU = *I;
3656 for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(),
3657 JE = LU.Formulae.end(); J != JE; ++J)
3658 assert(isLegalUse(J->AM, LU.MinOffset, LU.MaxOffset,
3659 LU.Kind, LU.AccessTy, TLI) &&
3660 "Illegal formula generated!");
3664 // Now that we've decided what we want, make it so.
3665 ImplementSolution(Solution, P);
3668 void LSRInstance::print_factors_and_types(raw_ostream &OS) const {
3669 if (Factors.empty() && Types.empty()) return;
3671 OS << "LSR has identified the following interesting factors and types: ";
3674 for (SmallSetVector<int64_t, 8>::const_iterator
3675 I = Factors.begin(), E = Factors.end(); I != E; ++I) {
3676 if (!First) OS << ", ";
3681 for (SmallSetVector<const Type *, 4>::const_iterator
3682 I = Types.begin(), E = Types.end(); I != E; ++I) {
3683 if (!First) OS << ", ";
3685 OS << '(' << **I << ')';
3690 void LSRInstance::print_fixups(raw_ostream &OS) const {
3691 OS << "LSR is examining the following fixup sites:\n";
3692 for (SmallVectorImpl<LSRFixup>::const_iterator I = Fixups.begin(),
3693 E = Fixups.end(); I != E; ++I) {
3700 void LSRInstance::print_uses(raw_ostream &OS) const {
3701 OS << "LSR is examining the following uses:\n";
3702 for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
3703 E = Uses.end(); I != E; ++I) {
3704 const LSRUse &LU = *I;
3708 for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(),
3709 JE = LU.Formulae.end(); J != JE; ++J) {
3717 void LSRInstance::print(raw_ostream &OS) const {
3718 print_factors_and_types(OS);
3723 void LSRInstance::dump() const {
3724 print(errs()); errs() << '\n';
3729 class LoopStrengthReduce : public LoopPass {
3730 /// TLI - Keep a pointer of a TargetLowering to consult for determining
3731 /// transformation profitability.
3732 const TargetLowering *const TLI;
3735 static char ID; // Pass ID, replacement for typeid
3736 explicit LoopStrengthReduce(const TargetLowering *tli = 0);
3739 bool runOnLoop(Loop *L, LPPassManager &LPM);
3740 void getAnalysisUsage(AnalysisUsage &AU) const;
3745 char LoopStrengthReduce::ID = 0;
3746 INITIALIZE_PASS(LoopStrengthReduce, "loop-reduce",
3747 "Loop Strength Reduction", false, false);
3749 Pass *llvm::createLoopStrengthReducePass(const TargetLowering *TLI) {
3750 return new LoopStrengthReduce(TLI);
3753 LoopStrengthReduce::LoopStrengthReduce(const TargetLowering *tli)
3754 : LoopPass(ID), TLI(tli) {}
3756 void LoopStrengthReduce::getAnalysisUsage(AnalysisUsage &AU) const {
3757 // We split critical edges, so we change the CFG. However, we do update
3758 // many analyses if they are around.
3759 AU.addPreservedID(LoopSimplifyID);
3760 AU.addPreserved("domfrontier");
3762 AU.addRequired<LoopInfo>();
3763 AU.addPreserved<LoopInfo>();
3764 AU.addRequiredID(LoopSimplifyID);
3765 AU.addRequired<DominatorTree>();
3766 AU.addPreserved<DominatorTree>();
3767 AU.addRequired<ScalarEvolution>();
3768 AU.addPreserved<ScalarEvolution>();
3769 AU.addRequired<IVUsers>();
3770 AU.addPreserved<IVUsers>();
3773 bool LoopStrengthReduce::runOnLoop(Loop *L, LPPassManager & /*LPM*/) {
3774 bool Changed = false;
3776 // Run the main LSR transformation.
3777 Changed |= LSRInstance(TLI, L, this).getChanged();
3779 // At this point, it is worth checking to see if any recurrence PHIs are also
3780 // dead, so that we can remove them as well.
3781 Changed |= DeleteDeadPHIs(L->getHeader());