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/Assembly/Writer.h"
67 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
68 #include "llvm/Transforms/Utils/Local.h"
69 #include "llvm/ADT/SmallBitVector.h"
70 #include "llvm/ADT/SetVector.h"
71 #include "llvm/ADT/DenseSet.h"
72 #include "llvm/Support/Debug.h"
73 #include "llvm/Support/ValueHandle.h"
74 #include "llvm/Support/raw_ostream.h"
75 #include "llvm/Target/TargetLowering.h"
81 /// RegSortData - This class holds data which is used to order reuse candidates.
84 /// UsedByIndices - This represents the set of LSRUse indices which reference
85 /// a particular register.
86 SmallBitVector UsedByIndices;
90 void print(raw_ostream &OS) const;
96 void RegSortData::print(raw_ostream &OS) const {
97 OS << "[NumUses=" << UsedByIndices.count() << ']';
100 void RegSortData::dump() const {
101 print(errs()); errs() << '\n';
106 /// RegUseTracker - Map register candidates to information about how they are
108 class RegUseTracker {
109 typedef DenseMap<const SCEV *, RegSortData> RegUsesTy;
111 RegUsesTy RegUsesMap;
112 SmallVector<const SCEV *, 16> RegSequence;
115 void CountRegister(const SCEV *Reg, size_t LUIdx);
116 void DropRegister(const SCEV *Reg, size_t LUIdx);
117 void SwapAndDropUse(size_t LUIdx, size_t LastLUIdx);
119 bool isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const;
121 const SmallBitVector &getUsedByIndices(const SCEV *Reg) const;
125 typedef SmallVectorImpl<const SCEV *>::iterator iterator;
126 typedef SmallVectorImpl<const SCEV *>::const_iterator const_iterator;
127 iterator begin() { return RegSequence.begin(); }
128 iterator end() { return RegSequence.end(); }
129 const_iterator begin() const { return RegSequence.begin(); }
130 const_iterator end() const { return RegSequence.end(); }
136 RegUseTracker::CountRegister(const SCEV *Reg, size_t LUIdx) {
137 std::pair<RegUsesTy::iterator, bool> Pair =
138 RegUsesMap.insert(std::make_pair(Reg, RegSortData()));
139 RegSortData &RSD = Pair.first->second;
141 RegSequence.push_back(Reg);
142 RSD.UsedByIndices.resize(std::max(RSD.UsedByIndices.size(), LUIdx + 1));
143 RSD.UsedByIndices.set(LUIdx);
147 RegUseTracker::DropRegister(const SCEV *Reg, size_t LUIdx) {
148 RegUsesTy::iterator It = RegUsesMap.find(Reg);
149 assert(It != RegUsesMap.end());
150 RegSortData &RSD = It->second;
151 assert(RSD.UsedByIndices.size() > LUIdx);
152 RSD.UsedByIndices.reset(LUIdx);
156 RegUseTracker::SwapAndDropUse(size_t LUIdx, size_t LastLUIdx) {
157 assert(LUIdx <= LastLUIdx);
159 // Update RegUses. The data structure is not optimized for this purpose;
160 // we must iterate through it and update each of the bit vectors.
161 for (RegUsesTy::iterator I = RegUsesMap.begin(), E = RegUsesMap.end();
163 SmallBitVector &UsedByIndices = I->second.UsedByIndices;
164 if (LUIdx < UsedByIndices.size())
165 UsedByIndices[LUIdx] =
166 LastLUIdx < UsedByIndices.size() ? UsedByIndices[LastLUIdx] : 0;
167 UsedByIndices.resize(std::min(UsedByIndices.size(), LastLUIdx));
172 RegUseTracker::isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const {
173 RegUsesTy::const_iterator I = RegUsesMap.find(Reg);
174 if (I == RegUsesMap.end())
176 const SmallBitVector &UsedByIndices = I->second.UsedByIndices;
177 int i = UsedByIndices.find_first();
178 if (i == -1) return false;
179 if ((size_t)i != LUIdx) return true;
180 return UsedByIndices.find_next(i) != -1;
183 const SmallBitVector &RegUseTracker::getUsedByIndices(const SCEV *Reg) const {
184 RegUsesTy::const_iterator I = RegUsesMap.find(Reg);
185 assert(I != RegUsesMap.end() && "Unknown register!");
186 return I->second.UsedByIndices;
189 void RegUseTracker::clear() {
196 /// Formula - This class holds information that describes a formula for
197 /// computing satisfying a use. It may include broken-out immediates and scaled
200 /// AM - This is used to represent complex addressing, as well as other kinds
201 /// of interesting uses.
202 TargetLowering::AddrMode AM;
204 /// BaseRegs - The list of "base" registers for this use. When this is
205 /// non-empty, AM.HasBaseReg should be set to true.
206 SmallVector<const SCEV *, 2> BaseRegs;
208 /// ScaledReg - The 'scaled' register for this use. This should be non-null
209 /// when AM.Scale is not zero.
210 const SCEV *ScaledReg;
212 Formula() : ScaledReg(0) {}
214 void InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
216 unsigned getNumRegs() const;
217 const Type *getType() const;
219 void DeleteBaseReg(const SCEV *&S);
221 bool referencesReg(const SCEV *S) const;
222 bool hasRegsUsedByUsesOtherThan(size_t LUIdx,
223 const RegUseTracker &RegUses) const;
225 void print(raw_ostream &OS) const;
231 /// DoInitialMatch - Recursion helper for InitialMatch.
232 static void DoInitialMatch(const SCEV *S, Loop *L,
233 SmallVectorImpl<const SCEV *> &Good,
234 SmallVectorImpl<const SCEV *> &Bad,
235 ScalarEvolution &SE) {
236 // Collect expressions which properly dominate the loop header.
237 if (SE.properlyDominates(S, L->getHeader())) {
242 // Look at add operands.
243 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
244 for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end();
246 DoInitialMatch(*I, L, Good, Bad, SE);
250 // Look at addrec operands.
251 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S))
252 if (!AR->getStart()->isZero()) {
253 DoInitialMatch(AR->getStart(), L, Good, Bad, SE);
254 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0),
255 AR->getStepRecurrence(SE),
256 // FIXME: AR->getNoWrapFlags()
257 AR->getLoop(), SCEV::FlagAnyWrap),
262 // Handle a multiplication by -1 (negation) if it didn't fold.
263 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S))
264 if (Mul->getOperand(0)->isAllOnesValue()) {
265 SmallVector<const SCEV *, 4> Ops(Mul->op_begin()+1, Mul->op_end());
266 const SCEV *NewMul = SE.getMulExpr(Ops);
268 SmallVector<const SCEV *, 4> MyGood;
269 SmallVector<const SCEV *, 4> MyBad;
270 DoInitialMatch(NewMul, L, MyGood, MyBad, SE);
271 const SCEV *NegOne = SE.getSCEV(ConstantInt::getAllOnesValue(
272 SE.getEffectiveSCEVType(NewMul->getType())));
273 for (SmallVectorImpl<const SCEV *>::const_iterator I = MyGood.begin(),
274 E = MyGood.end(); I != E; ++I)
275 Good.push_back(SE.getMulExpr(NegOne, *I));
276 for (SmallVectorImpl<const SCEV *>::const_iterator I = MyBad.begin(),
277 E = MyBad.end(); I != E; ++I)
278 Bad.push_back(SE.getMulExpr(NegOne, *I));
282 // Ok, we can't do anything interesting. Just stuff the whole thing into a
283 // register and hope for the best.
287 /// InitialMatch - Incorporate loop-variant parts of S into this Formula,
288 /// attempting to keep all loop-invariant and loop-computable values in a
289 /// single base register.
290 void Formula::InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) {
291 SmallVector<const SCEV *, 4> Good;
292 SmallVector<const SCEV *, 4> Bad;
293 DoInitialMatch(S, L, Good, Bad, SE);
295 const SCEV *Sum = SE.getAddExpr(Good);
297 BaseRegs.push_back(Sum);
298 AM.HasBaseReg = true;
301 const SCEV *Sum = SE.getAddExpr(Bad);
303 BaseRegs.push_back(Sum);
304 AM.HasBaseReg = true;
308 /// getNumRegs - Return the total number of register operands used by this
309 /// formula. This does not include register uses implied by non-constant
311 unsigned Formula::getNumRegs() const {
312 return !!ScaledReg + BaseRegs.size();
315 /// getType - Return the type of this formula, if it has one, or null
316 /// otherwise. This type is meaningless except for the bit size.
317 const Type *Formula::getType() const {
318 return !BaseRegs.empty() ? BaseRegs.front()->getType() :
319 ScaledReg ? ScaledReg->getType() :
320 AM.BaseGV ? AM.BaseGV->getType() :
324 /// DeleteBaseReg - Delete the given base reg from the BaseRegs list.
325 void Formula::DeleteBaseReg(const SCEV *&S) {
326 if (&S != &BaseRegs.back())
327 std::swap(S, BaseRegs.back());
331 /// referencesReg - Test if this formula references the given register.
332 bool Formula::referencesReg(const SCEV *S) const {
333 return S == ScaledReg ||
334 std::find(BaseRegs.begin(), BaseRegs.end(), S) != BaseRegs.end();
337 /// hasRegsUsedByUsesOtherThan - Test whether this formula uses registers
338 /// which are used by uses other than the use with the given index.
339 bool Formula::hasRegsUsedByUsesOtherThan(size_t LUIdx,
340 const RegUseTracker &RegUses) const {
342 if (RegUses.isRegUsedByUsesOtherThan(ScaledReg, LUIdx))
344 for (SmallVectorImpl<const SCEV *>::const_iterator I = BaseRegs.begin(),
345 E = BaseRegs.end(); I != E; ++I)
346 if (RegUses.isRegUsedByUsesOtherThan(*I, LUIdx))
351 void Formula::print(raw_ostream &OS) const {
354 if (!First) OS << " + "; else First = false;
355 WriteAsOperand(OS, AM.BaseGV, /*PrintType=*/false);
357 if (AM.BaseOffs != 0) {
358 if (!First) OS << " + "; else First = false;
361 for (SmallVectorImpl<const SCEV *>::const_iterator I = BaseRegs.begin(),
362 E = BaseRegs.end(); I != E; ++I) {
363 if (!First) OS << " + "; else First = false;
364 OS << "reg(" << **I << ')';
366 if (AM.HasBaseReg && BaseRegs.empty()) {
367 if (!First) OS << " + "; else First = false;
368 OS << "**error: HasBaseReg**";
369 } else if (!AM.HasBaseReg && !BaseRegs.empty()) {
370 if (!First) OS << " + "; else First = false;
371 OS << "**error: !HasBaseReg**";
374 if (!First) OS << " + "; else First = false;
375 OS << AM.Scale << "*reg(";
384 void Formula::dump() const {
385 print(errs()); errs() << '\n';
388 /// isAddRecSExtable - Return true if the given addrec can be sign-extended
389 /// without changing its value.
390 static bool isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) {
392 IntegerType::get(SE.getContext(), SE.getTypeSizeInBits(AR->getType()) + 1);
393 return isa<SCEVAddRecExpr>(SE.getSignExtendExpr(AR, WideTy));
396 /// isAddSExtable - Return true if the given add can be sign-extended
397 /// without changing its value.
398 static bool isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) {
400 IntegerType::get(SE.getContext(), SE.getTypeSizeInBits(A->getType()) + 1);
401 return isa<SCEVAddExpr>(SE.getSignExtendExpr(A, WideTy));
404 /// isMulSExtable - Return true if the given mul can be sign-extended
405 /// without changing its value.
406 static bool isMulSExtable(const SCEVMulExpr *M, ScalarEvolution &SE) {
408 IntegerType::get(SE.getContext(),
409 SE.getTypeSizeInBits(M->getType()) * M->getNumOperands());
410 return isa<SCEVMulExpr>(SE.getSignExtendExpr(M, WideTy));
413 /// getExactSDiv - Return an expression for LHS /s RHS, if it can be determined
414 /// and if the remainder is known to be zero, or null otherwise. If
415 /// IgnoreSignificantBits is true, expressions like (X * Y) /s Y are simplified
416 /// to Y, ignoring that the multiplication may overflow, which is useful when
417 /// the result will be used in a context where the most significant bits are
419 static const SCEV *getExactSDiv(const SCEV *LHS, const SCEV *RHS,
421 bool IgnoreSignificantBits = false) {
422 // Handle the trivial case, which works for any SCEV type.
424 return SE.getConstant(LHS->getType(), 1);
426 // Handle a few RHS special cases.
427 const SCEVConstant *RC = dyn_cast<SCEVConstant>(RHS);
429 const APInt &RA = RC->getValue()->getValue();
430 // Handle x /s -1 as x * -1, to give ScalarEvolution a chance to do
432 if (RA.isAllOnesValue())
433 return SE.getMulExpr(LHS, RC);
434 // Handle x /s 1 as x.
439 // Check for a division of a constant by a constant.
440 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(LHS)) {
443 const APInt &LA = C->getValue()->getValue();
444 const APInt &RA = RC->getValue()->getValue();
445 if (LA.srem(RA) != 0)
447 return SE.getConstant(LA.sdiv(RA));
450 // Distribute the sdiv over addrec operands, if the addrec doesn't overflow.
451 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(LHS)) {
452 if (IgnoreSignificantBits || isAddRecSExtable(AR, SE)) {
453 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE,
454 IgnoreSignificantBits);
456 const SCEV *Start = getExactSDiv(AR->getStart(), RHS, SE,
457 IgnoreSignificantBits);
458 if (!Start) return 0;
459 // FlagNW is independent of the start value, step direction, and is
460 // preserved with smaller magnitude steps.
461 // FIXME: AR->getNoWrapFlags(SCEV::FlagNW)
462 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap);
467 // Distribute the sdiv over add operands, if the add doesn't overflow.
468 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(LHS)) {
469 if (IgnoreSignificantBits || isAddSExtable(Add, SE)) {
470 SmallVector<const SCEV *, 8> Ops;
471 for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end();
473 const SCEV *Op = getExactSDiv(*I, RHS, SE,
474 IgnoreSignificantBits);
478 return SE.getAddExpr(Ops);
483 // Check for a multiply operand that we can pull RHS out of.
484 if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(LHS)) {
485 if (IgnoreSignificantBits || isMulSExtable(Mul, SE)) {
486 SmallVector<const SCEV *, 4> Ops;
488 for (SCEVMulExpr::op_iterator I = Mul->op_begin(), E = Mul->op_end();
492 if (const SCEV *Q = getExactSDiv(S, RHS, SE,
493 IgnoreSignificantBits)) {
499 return Found ? SE.getMulExpr(Ops) : 0;
504 // Otherwise we don't know.
508 /// ExtractImmediate - If S involves the addition of a constant integer value,
509 /// return that integer value, and mutate S to point to a new SCEV with that
511 static int64_t ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) {
512 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(S)) {
513 if (C->getValue()->getValue().getMinSignedBits() <= 64) {
514 S = SE.getConstant(C->getType(), 0);
515 return C->getValue()->getSExtValue();
517 } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
518 SmallVector<const SCEV *, 8> NewOps(Add->op_begin(), Add->op_end());
519 int64_t Result = ExtractImmediate(NewOps.front(), SE);
521 S = SE.getAddExpr(NewOps);
523 } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
524 SmallVector<const SCEV *, 8> NewOps(AR->op_begin(), AR->op_end());
525 int64_t Result = ExtractImmediate(NewOps.front(), SE);
527 S = SE.getAddRecExpr(NewOps, AR->getLoop(),
528 // FIXME: AR->getNoWrapFlags(SCEV::FlagNW)
535 /// ExtractSymbol - If S involves the addition of a GlobalValue address,
536 /// return that symbol, and mutate S to point to a new SCEV with that
538 static GlobalValue *ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) {
539 if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) {
540 if (GlobalValue *GV = dyn_cast<GlobalValue>(U->getValue())) {
541 S = SE.getConstant(GV->getType(), 0);
544 } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
545 SmallVector<const SCEV *, 8> NewOps(Add->op_begin(), Add->op_end());
546 GlobalValue *Result = ExtractSymbol(NewOps.back(), SE);
548 S = SE.getAddExpr(NewOps);
550 } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
551 SmallVector<const SCEV *, 8> NewOps(AR->op_begin(), AR->op_end());
552 GlobalValue *Result = ExtractSymbol(NewOps.front(), SE);
554 S = SE.getAddRecExpr(NewOps, AR->getLoop(),
555 // FIXME: AR->getNoWrapFlags(SCEV::FlagNW)
562 /// isAddressUse - Returns true if the specified instruction is using the
563 /// specified value as an address.
564 static bool isAddressUse(Instruction *Inst, Value *OperandVal) {
565 bool isAddress = isa<LoadInst>(Inst);
566 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
567 if (SI->getOperand(1) == OperandVal)
569 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
570 // Addressing modes can also be folded into prefetches and a variety
572 switch (II->getIntrinsicID()) {
574 case Intrinsic::prefetch:
575 case Intrinsic::x86_sse2_loadu_dq:
576 case Intrinsic::x86_sse2_loadu_pd:
577 case Intrinsic::x86_sse_loadu_ps:
578 case Intrinsic::x86_sse_storeu_ps:
579 case Intrinsic::x86_sse2_storeu_pd:
580 case Intrinsic::x86_sse2_storeu_dq:
581 case Intrinsic::x86_sse2_storel_dq:
582 if (II->getArgOperand(0) == OperandVal)
590 /// getAccessType - Return the type of the memory being accessed.
591 static const Type *getAccessType(const Instruction *Inst) {
592 const Type *AccessTy = Inst->getType();
593 if (const StoreInst *SI = dyn_cast<StoreInst>(Inst))
594 AccessTy = SI->getOperand(0)->getType();
595 else if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
596 // Addressing modes can also be folded into prefetches and a variety
598 switch (II->getIntrinsicID()) {
600 case Intrinsic::x86_sse_storeu_ps:
601 case Intrinsic::x86_sse2_storeu_pd:
602 case Intrinsic::x86_sse2_storeu_dq:
603 case Intrinsic::x86_sse2_storel_dq:
604 AccessTy = II->getArgOperand(0)->getType();
609 // All pointers have the same requirements, so canonicalize them to an
610 // arbitrary pointer type to minimize variation.
611 if (const PointerType *PTy = dyn_cast<PointerType>(AccessTy))
612 AccessTy = PointerType::get(IntegerType::get(PTy->getContext(), 1),
613 PTy->getAddressSpace());
618 /// DeleteTriviallyDeadInstructions - If any of the instructions is the
619 /// specified set are trivially dead, delete them and see if this makes any of
620 /// their operands subsequently dead.
622 DeleteTriviallyDeadInstructions(SmallVectorImpl<WeakVH> &DeadInsts) {
623 bool Changed = false;
625 while (!DeadInsts.empty()) {
626 Instruction *I = dyn_cast_or_null<Instruction>(&*DeadInsts.pop_back_val());
628 if (I == 0 || !isInstructionTriviallyDead(I))
631 for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI)
632 if (Instruction *U = dyn_cast<Instruction>(*OI)) {
635 DeadInsts.push_back(U);
638 I->eraseFromParent();
647 /// Cost - This class is used to measure and compare candidate formulae.
649 /// TODO: Some of these could be merged. Also, a lexical ordering
650 /// isn't always optimal.
654 unsigned NumBaseAdds;
660 : NumRegs(0), AddRecCost(0), NumIVMuls(0), NumBaseAdds(0), ImmCost(0),
663 bool operator<(const Cost &Other) const;
667 void RateFormula(const Formula &F,
668 SmallPtrSet<const SCEV *, 16> &Regs,
669 const DenseSet<const SCEV *> &VisitedRegs,
671 const SmallVectorImpl<int64_t> &Offsets,
672 ScalarEvolution &SE, DominatorTree &DT);
674 void print(raw_ostream &OS) const;
678 void RateRegister(const SCEV *Reg,
679 SmallPtrSet<const SCEV *, 16> &Regs,
681 ScalarEvolution &SE, DominatorTree &DT);
682 void RatePrimaryRegister(const SCEV *Reg,
683 SmallPtrSet<const SCEV *, 16> &Regs,
685 ScalarEvolution &SE, DominatorTree &DT);
690 /// RateRegister - Tally up interesting quantities from the given register.
691 void Cost::RateRegister(const SCEV *Reg,
692 SmallPtrSet<const SCEV *, 16> &Regs,
694 ScalarEvolution &SE, DominatorTree &DT) {
695 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Reg)) {
696 if (AR->getLoop() == L)
697 AddRecCost += 1; /// TODO: This should be a function of the stride.
699 // If this is an addrec for a loop that's already been visited by LSR,
700 // don't second-guess its addrec phi nodes. LSR isn't currently smart
701 // enough to reason about more than one loop at a time. Consider these
702 // registers free and leave them alone.
703 else if (L->contains(AR->getLoop()) ||
704 (!AR->getLoop()->contains(L) &&
705 DT.dominates(L->getHeader(), AR->getLoop()->getHeader()))) {
706 for (BasicBlock::iterator I = AR->getLoop()->getHeader()->begin();
707 PHINode *PN = dyn_cast<PHINode>(I); ++I)
708 if (SE.isSCEVable(PN->getType()) &&
709 (SE.getEffectiveSCEVType(PN->getType()) ==
710 SE.getEffectiveSCEVType(AR->getType())) &&
711 SE.getSCEV(PN) == AR)
714 // If this isn't one of the addrecs that the loop already has, it
715 // would require a costly new phi and add. TODO: This isn't
716 // precisely modeled right now.
718 if (!Regs.count(AR->getStart()))
719 RateRegister(AR->getStart(), Regs, L, SE, DT);
722 // Add the step value register, if it needs one.
723 // TODO: The non-affine case isn't precisely modeled here.
724 if (!AR->isAffine() || !isa<SCEVConstant>(AR->getOperand(1)))
725 if (!Regs.count(AR->getStart()))
726 RateRegister(AR->getOperand(1), Regs, L, SE, DT);
730 // Rough heuristic; favor registers which don't require extra setup
731 // instructions in the preheader.
732 if (!isa<SCEVUnknown>(Reg) &&
733 !isa<SCEVConstant>(Reg) &&
734 !(isa<SCEVAddRecExpr>(Reg) &&
735 (isa<SCEVUnknown>(cast<SCEVAddRecExpr>(Reg)->getStart()) ||
736 isa<SCEVConstant>(cast<SCEVAddRecExpr>(Reg)->getStart()))))
739 NumIVMuls += isa<SCEVMulExpr>(Reg) &&
740 SE.hasComputableLoopEvolution(Reg, L);
743 /// RatePrimaryRegister - Record this register in the set. If we haven't seen it
745 void Cost::RatePrimaryRegister(const SCEV *Reg,
746 SmallPtrSet<const SCEV *, 16> &Regs,
748 ScalarEvolution &SE, DominatorTree &DT) {
749 if (Regs.insert(Reg))
750 RateRegister(Reg, Regs, L, SE, DT);
753 void Cost::RateFormula(const Formula &F,
754 SmallPtrSet<const SCEV *, 16> &Regs,
755 const DenseSet<const SCEV *> &VisitedRegs,
757 const SmallVectorImpl<int64_t> &Offsets,
758 ScalarEvolution &SE, DominatorTree &DT) {
759 // Tally up the registers.
760 if (const SCEV *ScaledReg = F.ScaledReg) {
761 if (VisitedRegs.count(ScaledReg)) {
765 RatePrimaryRegister(ScaledReg, Regs, L, SE, DT);
767 for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(),
768 E = F.BaseRegs.end(); I != E; ++I) {
769 const SCEV *BaseReg = *I;
770 if (VisitedRegs.count(BaseReg)) {
774 RatePrimaryRegister(BaseReg, Regs, L, SE, DT);
777 if (F.BaseRegs.size() > 1)
778 NumBaseAdds += F.BaseRegs.size() - 1;
780 // Tally up the non-zero immediates.
781 for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(),
782 E = Offsets.end(); I != E; ++I) {
783 int64_t Offset = (uint64_t)*I + F.AM.BaseOffs;
785 ImmCost += 64; // Handle symbolic values conservatively.
786 // TODO: This should probably be the pointer size.
787 else if (Offset != 0)
788 ImmCost += APInt(64, Offset, true).getMinSignedBits();
792 /// Loose - Set this cost to a loosing value.
802 /// operator< - Choose the lower cost.
803 bool Cost::operator<(const Cost &Other) const {
804 if (NumRegs != Other.NumRegs)
805 return NumRegs < Other.NumRegs;
806 if (AddRecCost != Other.AddRecCost)
807 return AddRecCost < Other.AddRecCost;
808 if (NumIVMuls != Other.NumIVMuls)
809 return NumIVMuls < Other.NumIVMuls;
810 if (NumBaseAdds != Other.NumBaseAdds)
811 return NumBaseAdds < Other.NumBaseAdds;
812 if (ImmCost != Other.ImmCost)
813 return ImmCost < Other.ImmCost;
814 if (SetupCost != Other.SetupCost)
815 return SetupCost < Other.SetupCost;
819 void Cost::print(raw_ostream &OS) const {
820 OS << NumRegs << " reg" << (NumRegs == 1 ? "" : "s");
822 OS << ", with addrec cost " << AddRecCost;
824 OS << ", plus " << NumIVMuls << " IV mul" << (NumIVMuls == 1 ? "" : "s");
825 if (NumBaseAdds != 0)
826 OS << ", plus " << NumBaseAdds << " base add"
827 << (NumBaseAdds == 1 ? "" : "s");
829 OS << ", plus " << ImmCost << " imm cost";
831 OS << ", plus " << SetupCost << " setup cost";
834 void Cost::dump() const {
835 print(errs()); errs() << '\n';
840 /// LSRFixup - An operand value in an instruction which is to be replaced
841 /// with some equivalent, possibly strength-reduced, replacement.
843 /// UserInst - The instruction which will be updated.
844 Instruction *UserInst;
846 /// OperandValToReplace - The operand of the instruction which will
847 /// be replaced. The operand may be used more than once; every instance
848 /// will be replaced.
849 Value *OperandValToReplace;
851 /// PostIncLoops - If this user is to use the post-incremented value of an
852 /// induction variable, this variable is non-null and holds the loop
853 /// associated with the induction variable.
854 PostIncLoopSet PostIncLoops;
856 /// LUIdx - The index of the LSRUse describing the expression which
857 /// this fixup needs, minus an offset (below).
860 /// Offset - A constant offset to be added to the LSRUse expression.
861 /// This allows multiple fixups to share the same LSRUse with different
862 /// offsets, for example in an unrolled loop.
865 bool isUseFullyOutsideLoop(const Loop *L) const;
869 void print(raw_ostream &OS) const;
876 : UserInst(0), OperandValToReplace(0), LUIdx(~size_t(0)), Offset(0) {}
878 /// isUseFullyOutsideLoop - Test whether this fixup always uses its
879 /// value outside of the given loop.
880 bool LSRFixup::isUseFullyOutsideLoop(const Loop *L) const {
881 // PHI nodes use their value in their incoming blocks.
882 if (const PHINode *PN = dyn_cast<PHINode>(UserInst)) {
883 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
884 if (PN->getIncomingValue(i) == OperandValToReplace &&
885 L->contains(PN->getIncomingBlock(i)))
890 return !L->contains(UserInst);
893 void LSRFixup::print(raw_ostream &OS) const {
895 // Store is common and interesting enough to be worth special-casing.
896 if (StoreInst *Store = dyn_cast<StoreInst>(UserInst)) {
898 WriteAsOperand(OS, Store->getOperand(0), /*PrintType=*/false);
899 } else if (UserInst->getType()->isVoidTy())
900 OS << UserInst->getOpcodeName();
902 WriteAsOperand(OS, UserInst, /*PrintType=*/false);
904 OS << ", OperandValToReplace=";
905 WriteAsOperand(OS, OperandValToReplace, /*PrintType=*/false);
907 for (PostIncLoopSet::const_iterator I = PostIncLoops.begin(),
908 E = PostIncLoops.end(); I != E; ++I) {
909 OS << ", PostIncLoop=";
910 WriteAsOperand(OS, (*I)->getHeader(), /*PrintType=*/false);
913 if (LUIdx != ~size_t(0))
914 OS << ", LUIdx=" << LUIdx;
917 OS << ", Offset=" << Offset;
920 void LSRFixup::dump() const {
921 print(errs()); errs() << '\n';
926 /// UniquifierDenseMapInfo - A DenseMapInfo implementation for holding
927 /// DenseMaps and DenseSets of sorted SmallVectors of const SCEV*.
928 struct UniquifierDenseMapInfo {
929 static SmallVector<const SCEV *, 2> getEmptyKey() {
930 SmallVector<const SCEV *, 2> V;
931 V.push_back(reinterpret_cast<const SCEV *>(-1));
935 static SmallVector<const SCEV *, 2> getTombstoneKey() {
936 SmallVector<const SCEV *, 2> V;
937 V.push_back(reinterpret_cast<const SCEV *>(-2));
941 static unsigned getHashValue(const SmallVector<const SCEV *, 2> &V) {
943 for (SmallVectorImpl<const SCEV *>::const_iterator I = V.begin(),
944 E = V.end(); I != E; ++I)
945 Result ^= DenseMapInfo<const SCEV *>::getHashValue(*I);
949 static bool isEqual(const SmallVector<const SCEV *, 2> &LHS,
950 const SmallVector<const SCEV *, 2> &RHS) {
955 /// LSRUse - This class holds the state that LSR keeps for each use in
956 /// IVUsers, as well as uses invented by LSR itself. It includes information
957 /// about what kinds of things can be folded into the user, information about
958 /// the user itself, and information about how the use may be satisfied.
959 /// TODO: Represent multiple users of the same expression in common?
961 DenseSet<SmallVector<const SCEV *, 2>, UniquifierDenseMapInfo> Uniquifier;
964 /// KindType - An enum for a kind of use, indicating what types of
965 /// scaled and immediate operands it might support.
967 Basic, ///< A normal use, with no folding.
968 Special, ///< A special case of basic, allowing -1 scales.
969 Address, ///< An address use; folding according to TargetLowering
970 ICmpZero ///< An equality icmp with both operands folded into one.
971 // TODO: Add a generic icmp too?
975 const Type *AccessTy;
977 SmallVector<int64_t, 8> Offsets;
981 /// AllFixupsOutsideLoop - This records whether all of the fixups using this
982 /// LSRUse are outside of the loop, in which case some special-case heuristics
984 bool AllFixupsOutsideLoop;
986 /// WidestFixupType - This records the widest use type for any fixup using
987 /// this LSRUse. FindUseWithSimilarFormula can't consider uses with different
988 /// max fixup widths to be equivalent, because the narrower one may be relying
989 /// on the implicit truncation to truncate away bogus bits.
990 const Type *WidestFixupType;
992 /// Formulae - A list of ways to build a value that can satisfy this user.
993 /// After the list is populated, one of these is selected heuristically and
994 /// used to formulate a replacement for OperandValToReplace in UserInst.
995 SmallVector<Formula, 12> Formulae;
997 /// Regs - The set of register candidates used by all formulae in this LSRUse.
998 SmallPtrSet<const SCEV *, 4> Regs;
1000 LSRUse(KindType K, const Type *T) : Kind(K), AccessTy(T),
1001 MinOffset(INT64_MAX),
1002 MaxOffset(INT64_MIN),
1003 AllFixupsOutsideLoop(true),
1004 WidestFixupType(0) {}
1006 bool HasFormulaWithSameRegs(const Formula &F) const;
1007 bool InsertFormula(const Formula &F);
1008 void DeleteFormula(Formula &F);
1009 void RecomputeRegs(size_t LUIdx, RegUseTracker &Reguses);
1011 void print(raw_ostream &OS) const;
1017 /// HasFormula - Test whether this use as a formula which has the same
1018 /// registers as the given formula.
1019 bool LSRUse::HasFormulaWithSameRegs(const Formula &F) const {
1020 SmallVector<const SCEV *, 2> Key = F.BaseRegs;
1021 if (F.ScaledReg) Key.push_back(F.ScaledReg);
1022 // Unstable sort by host order ok, because this is only used for uniquifying.
1023 std::sort(Key.begin(), Key.end());
1024 return Uniquifier.count(Key);
1027 /// InsertFormula - If the given formula has not yet been inserted, add it to
1028 /// the list, and return true. Return false otherwise.
1029 bool LSRUse::InsertFormula(const Formula &F) {
1030 SmallVector<const SCEV *, 2> Key = F.BaseRegs;
1031 if (F.ScaledReg) Key.push_back(F.ScaledReg);
1032 // Unstable sort by host order ok, because this is only used for uniquifying.
1033 std::sort(Key.begin(), Key.end());
1035 if (!Uniquifier.insert(Key).second)
1038 // Using a register to hold the value of 0 is not profitable.
1039 assert((!F.ScaledReg || !F.ScaledReg->isZero()) &&
1040 "Zero allocated in a scaled register!");
1042 for (SmallVectorImpl<const SCEV *>::const_iterator I =
1043 F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I)
1044 assert(!(*I)->isZero() && "Zero allocated in a base register!");
1047 // Add the formula to the list.
1048 Formulae.push_back(F);
1050 // Record registers now being used by this use.
1051 if (F.ScaledReg) Regs.insert(F.ScaledReg);
1052 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end());
1057 /// DeleteFormula - Remove the given formula from this use's list.
1058 void LSRUse::DeleteFormula(Formula &F) {
1059 if (&F != &Formulae.back())
1060 std::swap(F, Formulae.back());
1061 Formulae.pop_back();
1062 assert(!Formulae.empty() && "LSRUse has no formulae left!");
1065 /// RecomputeRegs - Recompute the Regs field, and update RegUses.
1066 void LSRUse::RecomputeRegs(size_t LUIdx, RegUseTracker &RegUses) {
1067 // Now that we've filtered out some formulae, recompute the Regs set.
1068 SmallPtrSet<const SCEV *, 4> OldRegs = Regs;
1070 for (SmallVectorImpl<Formula>::const_iterator I = Formulae.begin(),
1071 E = Formulae.end(); I != E; ++I) {
1072 const Formula &F = *I;
1073 if (F.ScaledReg) Regs.insert(F.ScaledReg);
1074 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end());
1077 // Update the RegTracker.
1078 for (SmallPtrSet<const SCEV *, 4>::iterator I = OldRegs.begin(),
1079 E = OldRegs.end(); I != E; ++I)
1080 if (!Regs.count(*I))
1081 RegUses.DropRegister(*I, LUIdx);
1084 void LSRUse::print(raw_ostream &OS) const {
1085 OS << "LSR Use: Kind=";
1087 case Basic: OS << "Basic"; break;
1088 case Special: OS << "Special"; break;
1089 case ICmpZero: OS << "ICmpZero"; break;
1091 OS << "Address of ";
1092 if (AccessTy->isPointerTy())
1093 OS << "pointer"; // the full pointer type could be really verbose
1098 OS << ", Offsets={";
1099 for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(),
1100 E = Offsets.end(); I != E; ++I) {
1102 if (llvm::next(I) != E)
1107 if (AllFixupsOutsideLoop)
1108 OS << ", all-fixups-outside-loop";
1110 if (WidestFixupType)
1111 OS << ", widest fixup type: " << *WidestFixupType;
1114 void LSRUse::dump() const {
1115 print(errs()); errs() << '\n';
1118 /// isLegalUse - Test whether the use described by AM is "legal", meaning it can
1119 /// be completely folded into the user instruction at isel time. This includes
1120 /// address-mode folding and special icmp tricks.
1121 static bool isLegalUse(const TargetLowering::AddrMode &AM,
1122 LSRUse::KindType Kind, const Type *AccessTy,
1123 const TargetLowering *TLI) {
1125 case LSRUse::Address:
1126 // If we have low-level target information, ask the target if it can
1127 // completely fold this address.
1128 if (TLI) return TLI->isLegalAddressingMode(AM, AccessTy);
1130 // Otherwise, just guess that reg+reg addressing is legal.
1131 return !AM.BaseGV && AM.BaseOffs == 0 && AM.Scale <= 1;
1133 case LSRUse::ICmpZero:
1134 // There's not even a target hook for querying whether it would be legal to
1135 // fold a GV into an ICmp.
1139 // ICmp only has two operands; don't allow more than two non-trivial parts.
1140 if (AM.Scale != 0 && AM.HasBaseReg && AM.BaseOffs != 0)
1143 // ICmp only supports no scale or a -1 scale, as we can "fold" a -1 scale by
1144 // putting the scaled register in the other operand of the icmp.
1145 if (AM.Scale != 0 && AM.Scale != -1)
1148 // If we have low-level target information, ask the target if it can fold an
1149 // integer immediate on an icmp.
1150 if (AM.BaseOffs != 0) {
1151 if (TLI) return TLI->isLegalICmpImmediate(-AM.BaseOffs);
1158 // Only handle single-register values.
1159 return !AM.BaseGV && AM.Scale == 0 && AM.BaseOffs == 0;
1161 case LSRUse::Special:
1162 // Only handle -1 scales, or no scale.
1163 return AM.Scale == 0 || AM.Scale == -1;
1169 static bool isLegalUse(TargetLowering::AddrMode AM,
1170 int64_t MinOffset, int64_t MaxOffset,
1171 LSRUse::KindType Kind, const Type *AccessTy,
1172 const TargetLowering *TLI) {
1173 // Check for overflow.
1174 if (((int64_t)((uint64_t)AM.BaseOffs + MinOffset) > AM.BaseOffs) !=
1177 AM.BaseOffs = (uint64_t)AM.BaseOffs + MinOffset;
1178 if (isLegalUse(AM, Kind, AccessTy, TLI)) {
1179 AM.BaseOffs = (uint64_t)AM.BaseOffs - MinOffset;
1180 // Check for overflow.
1181 if (((int64_t)((uint64_t)AM.BaseOffs + MaxOffset) > AM.BaseOffs) !=
1184 AM.BaseOffs = (uint64_t)AM.BaseOffs + MaxOffset;
1185 return isLegalUse(AM, Kind, AccessTy, TLI);
1190 static bool isAlwaysFoldable(int64_t BaseOffs,
1191 GlobalValue *BaseGV,
1193 LSRUse::KindType Kind, const Type *AccessTy,
1194 const TargetLowering *TLI) {
1195 // Fast-path: zero is always foldable.
1196 if (BaseOffs == 0 && !BaseGV) return true;
1198 // Conservatively, create an address with an immediate and a
1199 // base and a scale.
1200 TargetLowering::AddrMode AM;
1201 AM.BaseOffs = BaseOffs;
1203 AM.HasBaseReg = HasBaseReg;
1204 AM.Scale = Kind == LSRUse::ICmpZero ? -1 : 1;
1206 // Canonicalize a scale of 1 to a base register if the formula doesn't
1207 // already have a base register.
1208 if (!AM.HasBaseReg && AM.Scale == 1) {
1210 AM.HasBaseReg = true;
1213 return isLegalUse(AM, Kind, AccessTy, TLI);
1216 static bool isAlwaysFoldable(const SCEV *S,
1217 int64_t MinOffset, int64_t MaxOffset,
1219 LSRUse::KindType Kind, const Type *AccessTy,
1220 const TargetLowering *TLI,
1221 ScalarEvolution &SE) {
1222 // Fast-path: zero is always foldable.
1223 if (S->isZero()) return true;
1225 // Conservatively, create an address with an immediate and a
1226 // base and a scale.
1227 int64_t BaseOffs = ExtractImmediate(S, SE);
1228 GlobalValue *BaseGV = ExtractSymbol(S, SE);
1230 // If there's anything else involved, it's not foldable.
1231 if (!S->isZero()) return false;
1233 // Fast-path: zero is always foldable.
1234 if (BaseOffs == 0 && !BaseGV) return true;
1236 // Conservatively, create an address with an immediate and a
1237 // base and a scale.
1238 TargetLowering::AddrMode AM;
1239 AM.BaseOffs = BaseOffs;
1241 AM.HasBaseReg = HasBaseReg;
1242 AM.Scale = Kind == LSRUse::ICmpZero ? -1 : 1;
1244 return isLegalUse(AM, MinOffset, MaxOffset, Kind, AccessTy, TLI);
1249 /// UseMapDenseMapInfo - A DenseMapInfo implementation for holding
1250 /// DenseMaps and DenseSets of pairs of const SCEV* and LSRUse::Kind.
1251 struct UseMapDenseMapInfo {
1252 static std::pair<const SCEV *, LSRUse::KindType> getEmptyKey() {
1253 return std::make_pair(reinterpret_cast<const SCEV *>(-1), LSRUse::Basic);
1256 static std::pair<const SCEV *, LSRUse::KindType> getTombstoneKey() {
1257 return std::make_pair(reinterpret_cast<const SCEV *>(-2), LSRUse::Basic);
1261 getHashValue(const std::pair<const SCEV *, LSRUse::KindType> &V) {
1262 unsigned Result = DenseMapInfo<const SCEV *>::getHashValue(V.first);
1263 Result ^= DenseMapInfo<unsigned>::getHashValue(unsigned(V.second));
1267 static bool isEqual(const std::pair<const SCEV *, LSRUse::KindType> &LHS,
1268 const std::pair<const SCEV *, LSRUse::KindType> &RHS) {
1273 /// LSRInstance - This class holds state for the main loop strength reduction
1277 ScalarEvolution &SE;
1280 const TargetLowering *const TLI;
1284 /// IVIncInsertPos - This is the insert position that the current loop's
1285 /// induction variable increment should be placed. In simple loops, this is
1286 /// the latch block's terminator. But in more complicated cases, this is a
1287 /// position which will dominate all the in-loop post-increment users.
1288 Instruction *IVIncInsertPos;
1290 /// Factors - Interesting factors between use strides.
1291 SmallSetVector<int64_t, 8> Factors;
1293 /// Types - Interesting use types, to facilitate truncation reuse.
1294 SmallSetVector<const Type *, 4> Types;
1296 /// Fixups - The list of operands which are to be replaced.
1297 SmallVector<LSRFixup, 16> Fixups;
1299 /// Uses - The list of interesting uses.
1300 SmallVector<LSRUse, 16> Uses;
1302 /// RegUses - Track which uses use which register candidates.
1303 RegUseTracker RegUses;
1305 void OptimizeShadowIV();
1306 bool FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse);
1307 ICmpInst *OptimizeMax(ICmpInst *Cond, IVStrideUse* &CondUse);
1308 void OptimizeLoopTermCond();
1310 void CollectInterestingTypesAndFactors();
1311 void CollectFixupsAndInitialFormulae();
1313 LSRFixup &getNewFixup() {
1314 Fixups.push_back(LSRFixup());
1315 return Fixups.back();
1318 // Support for sharing of LSRUses between LSRFixups.
1319 typedef DenseMap<std::pair<const SCEV *, LSRUse::KindType>,
1321 UseMapDenseMapInfo> UseMapTy;
1324 bool reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
1325 LSRUse::KindType Kind, const Type *AccessTy);
1327 std::pair<size_t, int64_t> getUse(const SCEV *&Expr,
1328 LSRUse::KindType Kind,
1329 const Type *AccessTy);
1331 void DeleteUse(LSRUse &LU, size_t LUIdx);
1333 LSRUse *FindUseWithSimilarFormula(const Formula &F, const LSRUse &OrigLU);
1336 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1337 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1338 void CountRegisters(const Formula &F, size_t LUIdx);
1339 bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F);
1341 void CollectLoopInvariantFixupsAndFormulae();
1343 void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base,
1344 unsigned Depth = 0);
1345 void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base);
1346 void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
1347 void GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
1348 void GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base);
1349 void GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base);
1350 void GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base);
1351 void GenerateCrossUseConstantOffsets();
1352 void GenerateAllReuseFormulae();
1354 void FilterOutUndesirableDedicatedRegisters();
1356 size_t EstimateSearchSpaceComplexity() const;
1357 void NarrowSearchSpaceByDetectingSupersets();
1358 void NarrowSearchSpaceByCollapsingUnrolledCode();
1359 void NarrowSearchSpaceByRefilteringUndesirableDedicatedRegisters();
1360 void NarrowSearchSpaceByPickingWinnerRegs();
1361 void NarrowSearchSpaceUsingHeuristics();
1363 void SolveRecurse(SmallVectorImpl<const Formula *> &Solution,
1365 SmallVectorImpl<const Formula *> &Workspace,
1366 const Cost &CurCost,
1367 const SmallPtrSet<const SCEV *, 16> &CurRegs,
1368 DenseSet<const SCEV *> &VisitedRegs) const;
1369 void Solve(SmallVectorImpl<const Formula *> &Solution) const;
1371 BasicBlock::iterator
1372 HoistInsertPosition(BasicBlock::iterator IP,
1373 const SmallVectorImpl<Instruction *> &Inputs) const;
1374 BasicBlock::iterator AdjustInsertPositionForExpand(BasicBlock::iterator IP,
1376 const LSRUse &LU) const;
1378 Value *Expand(const LSRFixup &LF,
1380 BasicBlock::iterator IP,
1381 SCEVExpander &Rewriter,
1382 SmallVectorImpl<WeakVH> &DeadInsts) const;
1383 void RewriteForPHI(PHINode *PN, const LSRFixup &LF,
1385 SCEVExpander &Rewriter,
1386 SmallVectorImpl<WeakVH> &DeadInsts,
1388 void Rewrite(const LSRFixup &LF,
1390 SCEVExpander &Rewriter,
1391 SmallVectorImpl<WeakVH> &DeadInsts,
1393 void ImplementSolution(const SmallVectorImpl<const Formula *> &Solution,
1396 LSRInstance(const TargetLowering *tli, Loop *l, Pass *P);
1398 bool getChanged() const { return Changed; }
1400 void print_factors_and_types(raw_ostream &OS) const;
1401 void print_fixups(raw_ostream &OS) const;
1402 void print_uses(raw_ostream &OS) const;
1403 void print(raw_ostream &OS) const;
1409 /// OptimizeShadowIV - If IV is used in a int-to-float cast
1410 /// inside the loop then try to eliminate the cast operation.
1411 void LSRInstance::OptimizeShadowIV() {
1412 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L);
1413 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
1416 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end();
1417 UI != E; /* empty */) {
1418 IVUsers::const_iterator CandidateUI = UI;
1420 Instruction *ShadowUse = CandidateUI->getUser();
1421 const Type *DestTy = NULL;
1423 /* If shadow use is a int->float cast then insert a second IV
1424 to eliminate this cast.
1426 for (unsigned i = 0; i < n; ++i)
1432 for (unsigned i = 0; i < n; ++i, ++d)
1435 if (UIToFPInst *UCast = dyn_cast<UIToFPInst>(CandidateUI->getUser()))
1436 DestTy = UCast->getDestTy();
1437 else if (SIToFPInst *SCast = dyn_cast<SIToFPInst>(CandidateUI->getUser()))
1438 DestTy = SCast->getDestTy();
1439 if (!DestTy) continue;
1442 // If target does not support DestTy natively then do not apply
1443 // this transformation.
1444 EVT DVT = TLI->getValueType(DestTy);
1445 if (!TLI->isTypeLegal(DVT)) continue;
1448 PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0));
1450 if (PH->getNumIncomingValues() != 2) continue;
1452 const Type *SrcTy = PH->getType();
1453 int Mantissa = DestTy->getFPMantissaWidth();
1454 if (Mantissa == -1) continue;
1455 if ((int)SE.getTypeSizeInBits(SrcTy) > Mantissa)
1458 unsigned Entry, Latch;
1459 if (PH->getIncomingBlock(0) == L->getLoopPreheader()) {
1467 ConstantInt *Init = dyn_cast<ConstantInt>(PH->getIncomingValue(Entry));
1468 if (!Init) continue;
1469 Constant *NewInit = ConstantFP::get(DestTy, Init->getZExtValue());
1471 BinaryOperator *Incr =
1472 dyn_cast<BinaryOperator>(PH->getIncomingValue(Latch));
1473 if (!Incr) continue;
1474 if (Incr->getOpcode() != Instruction::Add
1475 && Incr->getOpcode() != Instruction::Sub)
1478 /* Initialize new IV, double d = 0.0 in above example. */
1479 ConstantInt *C = NULL;
1480 if (Incr->getOperand(0) == PH)
1481 C = dyn_cast<ConstantInt>(Incr->getOperand(1));
1482 else if (Incr->getOperand(1) == PH)
1483 C = dyn_cast<ConstantInt>(Incr->getOperand(0));
1489 // Ignore negative constants, as the code below doesn't handle them
1490 // correctly. TODO: Remove this restriction.
1491 if (!C->getValue().isStrictlyPositive()) continue;
1493 /* Add new PHINode. */
1494 PHINode *NewPH = PHINode::Create(DestTy, "IV.S.", PH);
1495 NewPH->reserveOperandSpace(2);
1497 /* create new increment. '++d' in above example. */
1498 Constant *CFP = ConstantFP::get(DestTy, C->getZExtValue());
1499 BinaryOperator *NewIncr =
1500 BinaryOperator::Create(Incr->getOpcode() == Instruction::Add ?
1501 Instruction::FAdd : Instruction::FSub,
1502 NewPH, CFP, "IV.S.next.", Incr);
1504 NewPH->addIncoming(NewInit, PH->getIncomingBlock(Entry));
1505 NewPH->addIncoming(NewIncr, PH->getIncomingBlock(Latch));
1507 /* Remove cast operation */
1508 ShadowUse->replaceAllUsesWith(NewPH);
1509 ShadowUse->eraseFromParent();
1515 /// FindIVUserForCond - If Cond has an operand that is an expression of an IV,
1516 /// set the IV user and stride information and return true, otherwise return
1518 bool LSRInstance::FindIVUserForCond(ICmpInst *Cond, IVStrideUse *&CondUse) {
1519 for (IVUsers::iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI)
1520 if (UI->getUser() == Cond) {
1521 // NOTE: we could handle setcc instructions with multiple uses here, but
1522 // InstCombine does it as well for simple uses, it's not clear that it
1523 // occurs enough in real life to handle.
1530 /// OptimizeMax - Rewrite the loop's terminating condition if it uses
1531 /// a max computation.
1533 /// This is a narrow solution to a specific, but acute, problem. For loops
1539 /// } while (++i < n);
1541 /// the trip count isn't just 'n', because 'n' might not be positive. And
1542 /// unfortunately this can come up even for loops where the user didn't use
1543 /// a C do-while loop. For example, seemingly well-behaved top-test loops
1544 /// will commonly be lowered like this:
1550 /// } while (++i < n);
1553 /// and then it's possible for subsequent optimization to obscure the if
1554 /// test in such a way that indvars can't find it.
1556 /// When indvars can't find the if test in loops like this, it creates a
1557 /// max expression, which allows it to give the loop a canonical
1558 /// induction variable:
1561 /// max = n < 1 ? 1 : n;
1564 /// } while (++i != max);
1566 /// Canonical induction variables are necessary because the loop passes
1567 /// are designed around them. The most obvious example of this is the
1568 /// LoopInfo analysis, which doesn't remember trip count values. It
1569 /// expects to be able to rediscover the trip count each time it is
1570 /// needed, and it does this using a simple analysis that only succeeds if
1571 /// the loop has a canonical induction variable.
1573 /// However, when it comes time to generate code, the maximum operation
1574 /// can be quite costly, especially if it's inside of an outer loop.
1576 /// This function solves this problem by detecting this type of loop and
1577 /// rewriting their conditions from ICMP_NE back to ICMP_SLT, and deleting
1578 /// the instructions for the maximum computation.
1580 ICmpInst *LSRInstance::OptimizeMax(ICmpInst *Cond, IVStrideUse* &CondUse) {
1581 // Check that the loop matches the pattern we're looking for.
1582 if (Cond->getPredicate() != CmpInst::ICMP_EQ &&
1583 Cond->getPredicate() != CmpInst::ICMP_NE)
1586 SelectInst *Sel = dyn_cast<SelectInst>(Cond->getOperand(1));
1587 if (!Sel || !Sel->hasOneUse()) return Cond;
1589 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L);
1590 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount))
1592 const SCEV *One = SE.getConstant(BackedgeTakenCount->getType(), 1);
1594 // Add one to the backedge-taken count to get the trip count.
1595 const SCEV *IterationCount = SE.getAddExpr(One, BackedgeTakenCount);
1596 if (IterationCount != SE.getSCEV(Sel)) return Cond;
1598 // Check for a max calculation that matches the pattern. There's no check
1599 // for ICMP_ULE here because the comparison would be with zero, which
1600 // isn't interesting.
1601 CmpInst::Predicate Pred = ICmpInst::BAD_ICMP_PREDICATE;
1602 const SCEVNAryExpr *Max = 0;
1603 if (const SCEVSMaxExpr *S = dyn_cast<SCEVSMaxExpr>(BackedgeTakenCount)) {
1604 Pred = ICmpInst::ICMP_SLE;
1606 } else if (const SCEVSMaxExpr *S = dyn_cast<SCEVSMaxExpr>(IterationCount)) {
1607 Pred = ICmpInst::ICMP_SLT;
1609 } else if (const SCEVUMaxExpr *U = dyn_cast<SCEVUMaxExpr>(IterationCount)) {
1610 Pred = ICmpInst::ICMP_ULT;
1617 // To handle a max with more than two operands, this optimization would
1618 // require additional checking and setup.
1619 if (Max->getNumOperands() != 2)
1622 const SCEV *MaxLHS = Max->getOperand(0);
1623 const SCEV *MaxRHS = Max->getOperand(1);
1625 // ScalarEvolution canonicalizes constants to the left. For < and >, look
1626 // for a comparison with 1. For <= and >=, a comparison with zero.
1628 (ICmpInst::isTrueWhenEqual(Pred) ? !MaxLHS->isZero() : (MaxLHS != One)))
1631 // Check the relevant induction variable for conformance to
1633 const SCEV *IV = SE.getSCEV(Cond->getOperand(0));
1634 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV);
1635 if (!AR || !AR->isAffine() ||
1636 AR->getStart() != One ||
1637 AR->getStepRecurrence(SE) != One)
1640 assert(AR->getLoop() == L &&
1641 "Loop condition operand is an addrec in a different loop!");
1643 // Check the right operand of the select, and remember it, as it will
1644 // be used in the new comparison instruction.
1646 if (ICmpInst::isTrueWhenEqual(Pred)) {
1647 // Look for n+1, and grab n.
1648 if (AddOperator *BO = dyn_cast<AddOperator>(Sel->getOperand(1)))
1649 if (isa<ConstantInt>(BO->getOperand(1)) &&
1650 cast<ConstantInt>(BO->getOperand(1))->isOne() &&
1651 SE.getSCEV(BO->getOperand(0)) == MaxRHS)
1652 NewRHS = BO->getOperand(0);
1653 if (AddOperator *BO = dyn_cast<AddOperator>(Sel->getOperand(2)))
1654 if (isa<ConstantInt>(BO->getOperand(1)) &&
1655 cast<ConstantInt>(BO->getOperand(1))->isOne() &&
1656 SE.getSCEV(BO->getOperand(0)) == MaxRHS)
1657 NewRHS = BO->getOperand(0);
1660 } else if (SE.getSCEV(Sel->getOperand(1)) == MaxRHS)
1661 NewRHS = Sel->getOperand(1);
1662 else if (SE.getSCEV(Sel->getOperand(2)) == MaxRHS)
1663 NewRHS = Sel->getOperand(2);
1664 else if (const SCEVUnknown *SU = dyn_cast<SCEVUnknown>(MaxRHS))
1665 NewRHS = SU->getValue();
1667 // Max doesn't match expected pattern.
1670 // Determine the new comparison opcode. It may be signed or unsigned,
1671 // and the original comparison may be either equality or inequality.
1672 if (Cond->getPredicate() == CmpInst::ICMP_EQ)
1673 Pred = CmpInst::getInversePredicate(Pred);
1675 // Ok, everything looks ok to change the condition into an SLT or SGE and
1676 // delete the max calculation.
1678 new ICmpInst(Cond, Pred, Cond->getOperand(0), NewRHS, "scmp");
1680 // Delete the max calculation instructions.
1681 Cond->replaceAllUsesWith(NewCond);
1682 CondUse->setUser(NewCond);
1683 Instruction *Cmp = cast<Instruction>(Sel->getOperand(0));
1684 Cond->eraseFromParent();
1685 Sel->eraseFromParent();
1686 if (Cmp->use_empty())
1687 Cmp->eraseFromParent();
1691 /// OptimizeLoopTermCond - Change loop terminating condition to use the
1692 /// postinc iv when possible.
1694 LSRInstance::OptimizeLoopTermCond() {
1695 SmallPtrSet<Instruction *, 4> PostIncs;
1697 BasicBlock *LatchBlock = L->getLoopLatch();
1698 SmallVector<BasicBlock*, 8> ExitingBlocks;
1699 L->getExitingBlocks(ExitingBlocks);
1701 for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
1702 BasicBlock *ExitingBlock = ExitingBlocks[i];
1704 // Get the terminating condition for the loop if possible. If we
1705 // can, we want to change it to use a post-incremented version of its
1706 // induction variable, to allow coalescing the live ranges for the IV into
1707 // one register value.
1709 BranchInst *TermBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
1712 // FIXME: Overly conservative, termination condition could be an 'or' etc..
1713 if (TermBr->isUnconditional() || !isa<ICmpInst>(TermBr->getCondition()))
1716 // Search IVUsesByStride to find Cond's IVUse if there is one.
1717 IVStrideUse *CondUse = 0;
1718 ICmpInst *Cond = cast<ICmpInst>(TermBr->getCondition());
1719 if (!FindIVUserForCond(Cond, CondUse))
1722 // If the trip count is computed in terms of a max (due to ScalarEvolution
1723 // being unable to find a sufficient guard, for example), change the loop
1724 // comparison to use SLT or ULT instead of NE.
1725 // One consequence of doing this now is that it disrupts the count-down
1726 // optimization. That's not always a bad thing though, because in such
1727 // cases it may still be worthwhile to avoid a max.
1728 Cond = OptimizeMax(Cond, CondUse);
1730 // If this exiting block dominates the latch block, it may also use
1731 // the post-inc value if it won't be shared with other uses.
1732 // Check for dominance.
1733 if (!DT.dominates(ExitingBlock, LatchBlock))
1736 // Conservatively avoid trying to use the post-inc value in non-latch
1737 // exits if there may be pre-inc users in intervening blocks.
1738 if (LatchBlock != ExitingBlock)
1739 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI)
1740 // Test if the use is reachable from the exiting block. This dominator
1741 // query is a conservative approximation of reachability.
1742 if (&*UI != CondUse &&
1743 !DT.properlyDominates(UI->getUser()->getParent(), ExitingBlock)) {
1744 // Conservatively assume there may be reuse if the quotient of their
1745 // strides could be a legal scale.
1746 const SCEV *A = IU.getStride(*CondUse, L);
1747 const SCEV *B = IU.getStride(*UI, L);
1748 if (!A || !B) continue;
1749 if (SE.getTypeSizeInBits(A->getType()) !=
1750 SE.getTypeSizeInBits(B->getType())) {
1751 if (SE.getTypeSizeInBits(A->getType()) >
1752 SE.getTypeSizeInBits(B->getType()))
1753 B = SE.getSignExtendExpr(B, A->getType());
1755 A = SE.getSignExtendExpr(A, B->getType());
1757 if (const SCEVConstant *D =
1758 dyn_cast_or_null<SCEVConstant>(getExactSDiv(B, A, SE))) {
1759 const ConstantInt *C = D->getValue();
1760 // Stride of one or negative one can have reuse with non-addresses.
1761 if (C->isOne() || C->isAllOnesValue())
1762 goto decline_post_inc;
1763 // Avoid weird situations.
1764 if (C->getValue().getMinSignedBits() >= 64 ||
1765 C->getValue().isMinSignedValue())
1766 goto decline_post_inc;
1767 // Without TLI, assume that any stride might be valid, and so any
1768 // use might be shared.
1770 goto decline_post_inc;
1771 // Check for possible scaled-address reuse.
1772 const Type *AccessTy = getAccessType(UI->getUser());
1773 TargetLowering::AddrMode AM;
1774 AM.Scale = C->getSExtValue();
1775 if (TLI->isLegalAddressingMode(AM, AccessTy))
1776 goto decline_post_inc;
1777 AM.Scale = -AM.Scale;
1778 if (TLI->isLegalAddressingMode(AM, AccessTy))
1779 goto decline_post_inc;
1783 DEBUG(dbgs() << " Change loop exiting icmp to use postinc iv: "
1786 // It's possible for the setcc instruction to be anywhere in the loop, and
1787 // possible for it to have multiple users. If it is not immediately before
1788 // the exiting block branch, move it.
1789 if (&*++BasicBlock::iterator(Cond) != TermBr) {
1790 if (Cond->hasOneUse()) {
1791 Cond->moveBefore(TermBr);
1793 // Clone the terminating condition and insert into the loopend.
1794 ICmpInst *OldCond = Cond;
1795 Cond = cast<ICmpInst>(Cond->clone());
1796 Cond->setName(L->getHeader()->getName() + ".termcond");
1797 ExitingBlock->getInstList().insert(TermBr, Cond);
1799 // Clone the IVUse, as the old use still exists!
1800 CondUse = &IU.AddUser(Cond, CondUse->getOperandValToReplace());
1801 TermBr->replaceUsesOfWith(OldCond, Cond);
1805 // If we get to here, we know that we can transform the setcc instruction to
1806 // use the post-incremented version of the IV, allowing us to coalesce the
1807 // live ranges for the IV correctly.
1808 CondUse->transformToPostInc(L);
1811 PostIncs.insert(Cond);
1815 // Determine an insertion point for the loop induction variable increment. It
1816 // must dominate all the post-inc comparisons we just set up, and it must
1817 // dominate the loop latch edge.
1818 IVIncInsertPos = L->getLoopLatch()->getTerminator();
1819 for (SmallPtrSet<Instruction *, 4>::const_iterator I = PostIncs.begin(),
1820 E = PostIncs.end(); I != E; ++I) {
1822 DT.findNearestCommonDominator(IVIncInsertPos->getParent(),
1824 if (BB == (*I)->getParent())
1825 IVIncInsertPos = *I;
1826 else if (BB != IVIncInsertPos->getParent())
1827 IVIncInsertPos = BB->getTerminator();
1831 /// reconcileNewOffset - Determine if the given use can accomodate a fixup
1832 /// at the given offset and other details. If so, update the use and
1835 LSRInstance::reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
1836 LSRUse::KindType Kind, const Type *AccessTy) {
1837 int64_t NewMinOffset = LU.MinOffset;
1838 int64_t NewMaxOffset = LU.MaxOffset;
1839 const Type *NewAccessTy = AccessTy;
1841 // Check for a mismatched kind. It's tempting to collapse mismatched kinds to
1842 // something conservative, however this can pessimize in the case that one of
1843 // the uses will have all its uses outside the loop, for example.
1844 if (LU.Kind != Kind)
1846 // Conservatively assume HasBaseReg is true for now.
1847 if (NewOffset < LU.MinOffset) {
1848 if (!isAlwaysFoldable(LU.MaxOffset - NewOffset, 0, HasBaseReg,
1849 Kind, AccessTy, TLI))
1851 NewMinOffset = NewOffset;
1852 } else if (NewOffset > LU.MaxOffset) {
1853 if (!isAlwaysFoldable(NewOffset - LU.MinOffset, 0, HasBaseReg,
1854 Kind, AccessTy, TLI))
1856 NewMaxOffset = NewOffset;
1858 // Check for a mismatched access type, and fall back conservatively as needed.
1859 // TODO: Be less conservative when the type is similar and can use the same
1860 // addressing modes.
1861 if (Kind == LSRUse::Address && AccessTy != LU.AccessTy)
1862 NewAccessTy = Type::getVoidTy(AccessTy->getContext());
1865 LU.MinOffset = NewMinOffset;
1866 LU.MaxOffset = NewMaxOffset;
1867 LU.AccessTy = NewAccessTy;
1868 if (NewOffset != LU.Offsets.back())
1869 LU.Offsets.push_back(NewOffset);
1873 /// getUse - Return an LSRUse index and an offset value for a fixup which
1874 /// needs the given expression, with the given kind and optional access type.
1875 /// Either reuse an existing use or create a new one, as needed.
1876 std::pair<size_t, int64_t>
1877 LSRInstance::getUse(const SCEV *&Expr,
1878 LSRUse::KindType Kind, const Type *AccessTy) {
1879 const SCEV *Copy = Expr;
1880 int64_t Offset = ExtractImmediate(Expr, SE);
1882 // Basic uses can't accept any offset, for example.
1883 if (!isAlwaysFoldable(Offset, 0, /*HasBaseReg=*/true, Kind, AccessTy, TLI)) {
1888 std::pair<UseMapTy::iterator, bool> P =
1889 UseMap.insert(std::make_pair(std::make_pair(Expr, Kind), 0));
1891 // A use already existed with this base.
1892 size_t LUIdx = P.first->second;
1893 LSRUse &LU = Uses[LUIdx];
1894 if (reconcileNewOffset(LU, Offset, /*HasBaseReg=*/true, Kind, AccessTy))
1896 return std::make_pair(LUIdx, Offset);
1899 // Create a new use.
1900 size_t LUIdx = Uses.size();
1901 P.first->second = LUIdx;
1902 Uses.push_back(LSRUse(Kind, AccessTy));
1903 LSRUse &LU = Uses[LUIdx];
1905 // We don't need to track redundant offsets, but we don't need to go out
1906 // of our way here to avoid them.
1907 if (LU.Offsets.empty() || Offset != LU.Offsets.back())
1908 LU.Offsets.push_back(Offset);
1910 LU.MinOffset = Offset;
1911 LU.MaxOffset = Offset;
1912 return std::make_pair(LUIdx, Offset);
1915 /// DeleteUse - Delete the given use from the Uses list.
1916 void LSRInstance::DeleteUse(LSRUse &LU, size_t LUIdx) {
1917 if (&LU != &Uses.back())
1918 std::swap(LU, Uses.back());
1922 RegUses.SwapAndDropUse(LUIdx, Uses.size());
1925 /// FindUseWithFormula - Look for a use distinct from OrigLU which is has
1926 /// a formula that has the same registers as the given formula.
1928 LSRInstance::FindUseWithSimilarFormula(const Formula &OrigF,
1929 const LSRUse &OrigLU) {
1930 // Search all uses for the formula. This could be more clever.
1931 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
1932 LSRUse &LU = Uses[LUIdx];
1933 // Check whether this use is close enough to OrigLU, to see whether it's
1934 // worthwhile looking through its formulae.
1935 // Ignore ICmpZero uses because they may contain formulae generated by
1936 // GenerateICmpZeroScales, in which case adding fixup offsets may
1938 if (&LU != &OrigLU &&
1939 LU.Kind != LSRUse::ICmpZero &&
1940 LU.Kind == OrigLU.Kind && OrigLU.AccessTy == LU.AccessTy &&
1941 LU.WidestFixupType == OrigLU.WidestFixupType &&
1942 LU.HasFormulaWithSameRegs(OrigF)) {
1943 // Scan through this use's formulae.
1944 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(),
1945 E = LU.Formulae.end(); I != E; ++I) {
1946 const Formula &F = *I;
1947 // Check to see if this formula has the same registers and symbols
1949 if (F.BaseRegs == OrigF.BaseRegs &&
1950 F.ScaledReg == OrigF.ScaledReg &&
1951 F.AM.BaseGV == OrigF.AM.BaseGV &&
1952 F.AM.Scale == OrigF.AM.Scale) {
1953 if (F.AM.BaseOffs == 0)
1955 // This is the formula where all the registers and symbols matched;
1956 // there aren't going to be any others. Since we declined it, we
1957 // can skip the rest of the formulae and procede to the next LSRUse.
1964 // Nothing looked good.
1968 void LSRInstance::CollectInterestingTypesAndFactors() {
1969 SmallSetVector<const SCEV *, 4> Strides;
1971 // Collect interesting types and strides.
1972 SmallVector<const SCEV *, 4> Worklist;
1973 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) {
1974 const SCEV *Expr = IU.getExpr(*UI);
1976 // Collect interesting types.
1977 Types.insert(SE.getEffectiveSCEVType(Expr->getType()));
1979 // Add strides for mentioned loops.
1980 Worklist.push_back(Expr);
1982 const SCEV *S = Worklist.pop_back_val();
1983 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
1984 Strides.insert(AR->getStepRecurrence(SE));
1985 Worklist.push_back(AR->getStart());
1986 } else if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
1987 Worklist.append(Add->op_begin(), Add->op_end());
1989 } while (!Worklist.empty());
1992 // Compute interesting factors from the set of interesting strides.
1993 for (SmallSetVector<const SCEV *, 4>::const_iterator
1994 I = Strides.begin(), E = Strides.end(); I != E; ++I)
1995 for (SmallSetVector<const SCEV *, 4>::const_iterator NewStrideIter =
1996 llvm::next(I); NewStrideIter != E; ++NewStrideIter) {
1997 const SCEV *OldStride = *I;
1998 const SCEV *NewStride = *NewStrideIter;
2000 if (SE.getTypeSizeInBits(OldStride->getType()) !=
2001 SE.getTypeSizeInBits(NewStride->getType())) {
2002 if (SE.getTypeSizeInBits(OldStride->getType()) >
2003 SE.getTypeSizeInBits(NewStride->getType()))
2004 NewStride = SE.getSignExtendExpr(NewStride, OldStride->getType());
2006 OldStride = SE.getSignExtendExpr(OldStride, NewStride->getType());
2008 if (const SCEVConstant *Factor =
2009 dyn_cast_or_null<SCEVConstant>(getExactSDiv(NewStride, OldStride,
2011 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2012 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2013 } else if (const SCEVConstant *Factor =
2014 dyn_cast_or_null<SCEVConstant>(getExactSDiv(OldStride,
2017 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2018 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2022 // If all uses use the same type, don't bother looking for truncation-based
2024 if (Types.size() == 1)
2027 DEBUG(print_factors_and_types(dbgs()));
2030 void LSRInstance::CollectFixupsAndInitialFormulae() {
2031 for (IVUsers::const_iterator UI = IU.begin(), E = IU.end(); UI != E; ++UI) {
2033 LSRFixup &LF = getNewFixup();
2034 LF.UserInst = UI->getUser();
2035 LF.OperandValToReplace = UI->getOperandValToReplace();
2036 LF.PostIncLoops = UI->getPostIncLoops();
2038 LSRUse::KindType Kind = LSRUse::Basic;
2039 const Type *AccessTy = 0;
2040 if (isAddressUse(LF.UserInst, LF.OperandValToReplace)) {
2041 Kind = LSRUse::Address;
2042 AccessTy = getAccessType(LF.UserInst);
2045 const SCEV *S = IU.getExpr(*UI);
2047 // Equality (== and !=) ICmps are special. We can rewrite (i == N) as
2048 // (N - i == 0), and this allows (N - i) to be the expression that we work
2049 // with rather than just N or i, so we can consider the register
2050 // requirements for both N and i at the same time. Limiting this code to
2051 // equality icmps is not a problem because all interesting loops use
2052 // equality icmps, thanks to IndVarSimplify.
2053 if (ICmpInst *CI = dyn_cast<ICmpInst>(LF.UserInst))
2054 if (CI->isEquality()) {
2055 // Swap the operands if needed to put the OperandValToReplace on the
2056 // left, for consistency.
2057 Value *NV = CI->getOperand(1);
2058 if (NV == LF.OperandValToReplace) {
2059 CI->setOperand(1, CI->getOperand(0));
2060 CI->setOperand(0, NV);
2061 NV = CI->getOperand(1);
2065 // x == y --> x - y == 0
2066 const SCEV *N = SE.getSCEV(NV);
2067 if (SE.isLoopInvariant(N, L)) {
2068 Kind = LSRUse::ICmpZero;
2069 S = SE.getMinusSCEV(N, S);
2072 // -1 and the negations of all interesting strides (except the negation
2073 // of -1) are now also interesting.
2074 for (size_t i = 0, e = Factors.size(); i != e; ++i)
2075 if (Factors[i] != -1)
2076 Factors.insert(-(uint64_t)Factors[i]);
2080 // Set up the initial formula for this use.
2081 std::pair<size_t, int64_t> P = getUse(S, Kind, AccessTy);
2083 LF.Offset = P.second;
2084 LSRUse &LU = Uses[LF.LUIdx];
2085 LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L);
2086 if (!LU.WidestFixupType ||
2087 SE.getTypeSizeInBits(LU.WidestFixupType) <
2088 SE.getTypeSizeInBits(LF.OperandValToReplace->getType()))
2089 LU.WidestFixupType = LF.OperandValToReplace->getType();
2091 // If this is the first use of this LSRUse, give it a formula.
2092 if (LU.Formulae.empty()) {
2093 InsertInitialFormula(S, LU, LF.LUIdx);
2094 CountRegisters(LU.Formulae.back(), LF.LUIdx);
2098 DEBUG(print_fixups(dbgs()));
2101 /// InsertInitialFormula - Insert a formula for the given expression into
2102 /// the given use, separating out loop-variant portions from loop-invariant
2103 /// and loop-computable portions.
2105 LSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) {
2107 F.InitialMatch(S, L, SE);
2108 bool Inserted = InsertFormula(LU, LUIdx, F);
2109 assert(Inserted && "Initial formula already exists!"); (void)Inserted;
2112 /// InsertSupplementalFormula - Insert a simple single-register formula for
2113 /// the given expression into the given use.
2115 LSRInstance::InsertSupplementalFormula(const SCEV *S,
2116 LSRUse &LU, size_t LUIdx) {
2118 F.BaseRegs.push_back(S);
2119 F.AM.HasBaseReg = true;
2120 bool Inserted = InsertFormula(LU, LUIdx, F);
2121 assert(Inserted && "Supplemental formula already exists!"); (void)Inserted;
2124 /// CountRegisters - Note which registers are used by the given formula,
2125 /// updating RegUses.
2126 void LSRInstance::CountRegisters(const Formula &F, size_t LUIdx) {
2128 RegUses.CountRegister(F.ScaledReg, LUIdx);
2129 for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(),
2130 E = F.BaseRegs.end(); I != E; ++I)
2131 RegUses.CountRegister(*I, LUIdx);
2134 /// InsertFormula - If the given formula has not yet been inserted, add it to
2135 /// the list, and return true. Return false otherwise.
2136 bool LSRInstance::InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) {
2137 if (!LU.InsertFormula(F))
2140 CountRegisters(F, LUIdx);
2144 /// CollectLoopInvariantFixupsAndFormulae - Check for other uses of
2145 /// loop-invariant values which we're tracking. These other uses will pin these
2146 /// values in registers, making them less profitable for elimination.
2147 /// TODO: This currently misses non-constant addrec step registers.
2148 /// TODO: Should this give more weight to users inside the loop?
2150 LSRInstance::CollectLoopInvariantFixupsAndFormulae() {
2151 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end());
2152 SmallPtrSet<const SCEV *, 8> Inserted;
2154 while (!Worklist.empty()) {
2155 const SCEV *S = Worklist.pop_back_val();
2157 if (const SCEVNAryExpr *N = dyn_cast<SCEVNAryExpr>(S))
2158 Worklist.append(N->op_begin(), N->op_end());
2159 else if (const SCEVCastExpr *C = dyn_cast<SCEVCastExpr>(S))
2160 Worklist.push_back(C->getOperand());
2161 else if (const SCEVUDivExpr *D = dyn_cast<SCEVUDivExpr>(S)) {
2162 Worklist.push_back(D->getLHS());
2163 Worklist.push_back(D->getRHS());
2164 } else if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(S)) {
2165 if (!Inserted.insert(U)) continue;
2166 const Value *V = U->getValue();
2167 if (const Instruction *Inst = dyn_cast<Instruction>(V)) {
2168 // Look for instructions defined outside the loop.
2169 if (L->contains(Inst)) continue;
2170 } else if (isa<UndefValue>(V))
2171 // Undef doesn't have a live range, so it doesn't matter.
2173 for (Value::const_use_iterator UI = V->use_begin(), UE = V->use_end();
2175 const Instruction *UserInst = dyn_cast<Instruction>(*UI);
2176 // Ignore non-instructions.
2179 // Ignore instructions in other functions (as can happen with
2181 if (UserInst->getParent()->getParent() != L->getHeader()->getParent())
2183 // Ignore instructions not dominated by the loop.
2184 const BasicBlock *UseBB = !isa<PHINode>(UserInst) ?
2185 UserInst->getParent() :
2186 cast<PHINode>(UserInst)->getIncomingBlock(
2187 PHINode::getIncomingValueNumForOperand(UI.getOperandNo()));
2188 if (!DT.dominates(L->getHeader(), UseBB))
2190 // Ignore uses which are part of other SCEV expressions, to avoid
2191 // analyzing them multiple times.
2192 if (SE.isSCEVable(UserInst->getType())) {
2193 const SCEV *UserS = SE.getSCEV(const_cast<Instruction *>(UserInst));
2194 // If the user is a no-op, look through to its uses.
2195 if (!isa<SCEVUnknown>(UserS))
2199 SE.getUnknown(const_cast<Instruction *>(UserInst)));
2203 // Ignore icmp instructions which are already being analyzed.
2204 if (const ICmpInst *ICI = dyn_cast<ICmpInst>(UserInst)) {
2205 unsigned OtherIdx = !UI.getOperandNo();
2206 Value *OtherOp = const_cast<Value *>(ICI->getOperand(OtherIdx));
2207 if (SE.hasComputableLoopEvolution(SE.getSCEV(OtherOp), L))
2211 LSRFixup &LF = getNewFixup();
2212 LF.UserInst = const_cast<Instruction *>(UserInst);
2213 LF.OperandValToReplace = UI.getUse();
2214 std::pair<size_t, int64_t> P = getUse(S, LSRUse::Basic, 0);
2216 LF.Offset = P.second;
2217 LSRUse &LU = Uses[LF.LUIdx];
2218 LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L);
2219 if (!LU.WidestFixupType ||
2220 SE.getTypeSizeInBits(LU.WidestFixupType) <
2221 SE.getTypeSizeInBits(LF.OperandValToReplace->getType()))
2222 LU.WidestFixupType = LF.OperandValToReplace->getType();
2223 InsertSupplementalFormula(U, LU, LF.LUIdx);
2224 CountRegisters(LU.Formulae.back(), Uses.size() - 1);
2231 /// CollectSubexprs - Split S into subexpressions which can be pulled out into
2232 /// separate registers. If C is non-null, multiply each subexpression by C.
2233 static void CollectSubexprs(const SCEV *S, const SCEVConstant *C,
2234 SmallVectorImpl<const SCEV *> &Ops,
2236 ScalarEvolution &SE) {
2237 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(S)) {
2238 // Break out add operands.
2239 for (SCEVAddExpr::op_iterator I = Add->op_begin(), E = Add->op_end();
2241 CollectSubexprs(*I, C, Ops, L, SE);
2243 } else if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(S)) {
2244 // Split a non-zero base out of an addrec.
2245 if (!AR->getStart()->isZero()) {
2246 CollectSubexprs(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0),
2247 AR->getStepRecurrence(SE),
2249 //FIXME: AR->getNoWrapFlags(SCEV::FlagNW)
2252 CollectSubexprs(AR->getStart(), C, Ops, L, SE);
2255 } else if (const SCEVMulExpr *Mul = dyn_cast<SCEVMulExpr>(S)) {
2256 // Break (C * (a + b + c)) into C*a + C*b + C*c.
2257 if (Mul->getNumOperands() == 2)
2258 if (const SCEVConstant *Op0 =
2259 dyn_cast<SCEVConstant>(Mul->getOperand(0))) {
2260 CollectSubexprs(Mul->getOperand(1),
2261 C ? cast<SCEVConstant>(SE.getMulExpr(C, Op0)) : Op0,
2267 // Otherwise use the value itself, optionally with a scale applied.
2268 Ops.push_back(C ? SE.getMulExpr(C, S) : S);
2271 /// GenerateReassociations - Split out subexpressions from adds and the bases of
2273 void LSRInstance::GenerateReassociations(LSRUse &LU, unsigned LUIdx,
2276 // Arbitrarily cap recursion to protect compile time.
2277 if (Depth >= 3) return;
2279 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
2280 const SCEV *BaseReg = Base.BaseRegs[i];
2282 SmallVector<const SCEV *, 8> AddOps;
2283 CollectSubexprs(BaseReg, 0, AddOps, L, SE);
2285 if (AddOps.size() == 1) continue;
2287 for (SmallVectorImpl<const SCEV *>::const_iterator J = AddOps.begin(),
2288 JE = AddOps.end(); J != JE; ++J) {
2290 // Loop-variant "unknown" values are uninteresting; we won't be able to
2291 // do anything meaningful with them.
2292 if (isa<SCEVUnknown>(*J) && !SE.isLoopInvariant(*J, L))
2295 // Don't pull a constant into a register if the constant could be folded
2296 // into an immediate field.
2297 if (isAlwaysFoldable(*J, LU.MinOffset, LU.MaxOffset,
2298 Base.getNumRegs() > 1,
2299 LU.Kind, LU.AccessTy, TLI, SE))
2302 // Collect all operands except *J.
2303 SmallVector<const SCEV *, 8> InnerAddOps
2304 (((const SmallVector<const SCEV *, 8> &)AddOps).begin(), J);
2306 (llvm::next(J), ((const SmallVector<const SCEV *, 8> &)AddOps).end());
2308 // Don't leave just a constant behind in a register if the constant could
2309 // be folded into an immediate field.
2310 if (InnerAddOps.size() == 1 &&
2311 isAlwaysFoldable(InnerAddOps[0], LU.MinOffset, LU.MaxOffset,
2312 Base.getNumRegs() > 1,
2313 LU.Kind, LU.AccessTy, TLI, SE))
2316 const SCEV *InnerSum = SE.getAddExpr(InnerAddOps);
2317 if (InnerSum->isZero())
2320 F.BaseRegs[i] = InnerSum;
2321 F.BaseRegs.push_back(*J);
2322 if (InsertFormula(LU, LUIdx, F))
2323 // If that formula hadn't been seen before, recurse to find more like
2325 GenerateReassociations(LU, LUIdx, LU.Formulae.back(), Depth+1);
2330 /// GenerateCombinations - Generate a formula consisting of all of the
2331 /// loop-dominating registers added into a single register.
2332 void LSRInstance::GenerateCombinations(LSRUse &LU, unsigned LUIdx,
2334 // This method is only interesting on a plurality of registers.
2335 if (Base.BaseRegs.size() <= 1) return;
2339 SmallVector<const SCEV *, 4> Ops;
2340 for (SmallVectorImpl<const SCEV *>::const_iterator
2341 I = Base.BaseRegs.begin(), E = Base.BaseRegs.end(); I != E; ++I) {
2342 const SCEV *BaseReg = *I;
2343 if (SE.properlyDominates(BaseReg, L->getHeader()) &&
2344 !SE.hasComputableLoopEvolution(BaseReg, L))
2345 Ops.push_back(BaseReg);
2347 F.BaseRegs.push_back(BaseReg);
2349 if (Ops.size() > 1) {
2350 const SCEV *Sum = SE.getAddExpr(Ops);
2351 // TODO: If Sum is zero, it probably means ScalarEvolution missed an
2352 // opportunity to fold something. For now, just ignore such cases
2353 // rather than proceed with zero in a register.
2354 if (!Sum->isZero()) {
2355 F.BaseRegs.push_back(Sum);
2356 (void)InsertFormula(LU, LUIdx, F);
2361 /// GenerateSymbolicOffsets - Generate reuse formulae using symbolic offsets.
2362 void LSRInstance::GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx,
2364 // We can't add a symbolic offset if the address already contains one.
2365 if (Base.AM.BaseGV) return;
2367 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
2368 const SCEV *G = Base.BaseRegs[i];
2369 GlobalValue *GV = ExtractSymbol(G, SE);
2370 if (G->isZero() || !GV)
2374 if (!isLegalUse(F.AM, LU.MinOffset, LU.MaxOffset,
2375 LU.Kind, LU.AccessTy, TLI))
2378 (void)InsertFormula(LU, LUIdx, F);
2382 /// GenerateConstantOffsets - Generate reuse formulae using symbolic offsets.
2383 void LSRInstance::GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx,
2385 // TODO: For now, just add the min and max offset, because it usually isn't
2386 // worthwhile looking at everything inbetween.
2387 SmallVector<int64_t, 2> Worklist;
2388 Worklist.push_back(LU.MinOffset);
2389 if (LU.MaxOffset != LU.MinOffset)
2390 Worklist.push_back(LU.MaxOffset);
2392 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
2393 const SCEV *G = Base.BaseRegs[i];
2395 for (SmallVectorImpl<int64_t>::const_iterator I = Worklist.begin(),
2396 E = Worklist.end(); I != E; ++I) {
2398 F.AM.BaseOffs = (uint64_t)Base.AM.BaseOffs - *I;
2399 if (isLegalUse(F.AM, LU.MinOffset - *I, LU.MaxOffset - *I,
2400 LU.Kind, LU.AccessTy, TLI)) {
2401 // Add the offset to the base register.
2402 const SCEV *NewG = SE.getAddExpr(SE.getConstant(G->getType(), *I), G);
2403 // If it cancelled out, drop the base register, otherwise update it.
2404 if (NewG->isZero()) {
2405 std::swap(F.BaseRegs[i], F.BaseRegs.back());
2406 F.BaseRegs.pop_back();
2408 F.BaseRegs[i] = NewG;
2410 (void)InsertFormula(LU, LUIdx, F);
2414 int64_t Imm = ExtractImmediate(G, SE);
2415 if (G->isZero() || Imm == 0)
2418 F.AM.BaseOffs = (uint64_t)F.AM.BaseOffs + Imm;
2419 if (!isLegalUse(F.AM, LU.MinOffset, LU.MaxOffset,
2420 LU.Kind, LU.AccessTy, TLI))
2423 (void)InsertFormula(LU, LUIdx, F);
2427 /// GenerateICmpZeroScales - For ICmpZero, check to see if we can scale up
2428 /// the comparison. For example, x == y -> x*c == y*c.
2429 void LSRInstance::GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx,
2431 if (LU.Kind != LSRUse::ICmpZero) return;
2433 // Determine the integer type for the base formula.
2434 const Type *IntTy = Base.getType();
2436 if (SE.getTypeSizeInBits(IntTy) > 64) return;
2438 // Don't do this if there is more than one offset.
2439 if (LU.MinOffset != LU.MaxOffset) return;
2441 assert(!Base.AM.BaseGV && "ICmpZero use is not legal!");
2443 // Check each interesting stride.
2444 for (SmallSetVector<int64_t, 8>::const_iterator
2445 I = Factors.begin(), E = Factors.end(); I != E; ++I) {
2446 int64_t Factor = *I;
2448 // Check that the multiplication doesn't overflow.
2449 if (Base.AM.BaseOffs == INT64_MIN && Factor == -1)
2451 int64_t NewBaseOffs = (uint64_t)Base.AM.BaseOffs * Factor;
2452 if (NewBaseOffs / Factor != Base.AM.BaseOffs)
2455 // Check that multiplying with the use offset doesn't overflow.
2456 int64_t Offset = LU.MinOffset;
2457 if (Offset == INT64_MIN && Factor == -1)
2459 Offset = (uint64_t)Offset * Factor;
2460 if (Offset / Factor != LU.MinOffset)
2464 F.AM.BaseOffs = NewBaseOffs;
2466 // Check that this scale is legal.
2467 if (!isLegalUse(F.AM, Offset, Offset, LU.Kind, LU.AccessTy, TLI))
2470 // Compensate for the use having MinOffset built into it.
2471 F.AM.BaseOffs = (uint64_t)F.AM.BaseOffs + Offset - LU.MinOffset;
2473 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
2475 // Check that multiplying with each base register doesn't overflow.
2476 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) {
2477 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS);
2478 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i])
2482 // Check that multiplying with the scaled register doesn't overflow.
2484 F.ScaledReg = SE.getMulExpr(F.ScaledReg, FactorS);
2485 if (getExactSDiv(F.ScaledReg, FactorS, SE) != Base.ScaledReg)
2489 // If we make it here and it's legal, add it.
2490 (void)InsertFormula(LU, LUIdx, F);
2495 /// GenerateScales - Generate stride factor reuse formulae by making use of
2496 /// scaled-offset address modes, for example.
2497 void LSRInstance::GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) {
2498 // Determine the integer type for the base formula.
2499 const Type *IntTy = Base.getType();
2502 // If this Formula already has a scaled register, we can't add another one.
2503 if (Base.AM.Scale != 0) return;
2505 // Check each interesting stride.
2506 for (SmallSetVector<int64_t, 8>::const_iterator
2507 I = Factors.begin(), E = Factors.end(); I != E; ++I) {
2508 int64_t Factor = *I;
2510 Base.AM.Scale = Factor;
2511 Base.AM.HasBaseReg = Base.BaseRegs.size() > 1;
2512 // Check whether this scale is going to be legal.
2513 if (!isLegalUse(Base.AM, LU.MinOffset, LU.MaxOffset,
2514 LU.Kind, LU.AccessTy, TLI)) {
2515 // As a special-case, handle special out-of-loop Basic users specially.
2516 // TODO: Reconsider this special case.
2517 if (LU.Kind == LSRUse::Basic &&
2518 isLegalUse(Base.AM, LU.MinOffset, LU.MaxOffset,
2519 LSRUse::Special, LU.AccessTy, TLI) &&
2520 LU.AllFixupsOutsideLoop)
2521 LU.Kind = LSRUse::Special;
2525 // For an ICmpZero, negating a solitary base register won't lead to
2527 if (LU.Kind == LSRUse::ICmpZero &&
2528 !Base.AM.HasBaseReg && Base.AM.BaseOffs == 0 && !Base.AM.BaseGV)
2530 // For each addrec base reg, apply the scale, if possible.
2531 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i)
2532 if (const SCEVAddRecExpr *AR =
2533 dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i])) {
2534 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
2535 if (FactorS->isZero())
2537 // Divide out the factor, ignoring high bits, since we'll be
2538 // scaling the value back up in the end.
2539 if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) {
2540 // TODO: This could be optimized to avoid all the copying.
2542 F.ScaledReg = Quotient;
2543 F.DeleteBaseReg(F.BaseRegs[i]);
2544 (void)InsertFormula(LU, LUIdx, F);
2550 /// GenerateTruncates - Generate reuse formulae from different IV types.
2551 void LSRInstance::GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) {
2552 // This requires TargetLowering to tell us which truncates are free.
2555 // Don't bother truncating symbolic values.
2556 if (Base.AM.BaseGV) return;
2558 // Determine the integer type for the base formula.
2559 const Type *DstTy = Base.getType();
2561 DstTy = SE.getEffectiveSCEVType(DstTy);
2563 for (SmallSetVector<const Type *, 4>::const_iterator
2564 I = Types.begin(), E = Types.end(); I != E; ++I) {
2565 const Type *SrcTy = *I;
2566 if (SrcTy != DstTy && TLI->isTruncateFree(SrcTy, DstTy)) {
2569 if (F.ScaledReg) F.ScaledReg = SE.getAnyExtendExpr(F.ScaledReg, *I);
2570 for (SmallVectorImpl<const SCEV *>::iterator J = F.BaseRegs.begin(),
2571 JE = F.BaseRegs.end(); J != JE; ++J)
2572 *J = SE.getAnyExtendExpr(*J, SrcTy);
2574 // TODO: This assumes we've done basic processing on all uses and
2575 // have an idea what the register usage is.
2576 if (!F.hasRegsUsedByUsesOtherThan(LUIdx, RegUses))
2579 (void)InsertFormula(LU, LUIdx, F);
2586 /// WorkItem - Helper class for GenerateCrossUseConstantOffsets. It's used to
2587 /// defer modifications so that the search phase doesn't have to worry about
2588 /// the data structures moving underneath it.
2592 const SCEV *OrigReg;
2594 WorkItem(size_t LI, int64_t I, const SCEV *R)
2595 : LUIdx(LI), Imm(I), OrigReg(R) {}
2597 void print(raw_ostream &OS) const;
2603 void WorkItem::print(raw_ostream &OS) const {
2604 OS << "in formulae referencing " << *OrigReg << " in use " << LUIdx
2605 << " , add offset " << Imm;
2608 void WorkItem::dump() const {
2609 print(errs()); errs() << '\n';
2612 /// GenerateCrossUseConstantOffsets - Look for registers which are a constant
2613 /// distance apart and try to form reuse opportunities between them.
2614 void LSRInstance::GenerateCrossUseConstantOffsets() {
2615 // Group the registers by their value without any added constant offset.
2616 typedef std::map<int64_t, const SCEV *> ImmMapTy;
2617 typedef DenseMap<const SCEV *, ImmMapTy> RegMapTy;
2619 DenseMap<const SCEV *, SmallBitVector> UsedByIndicesMap;
2620 SmallVector<const SCEV *, 8> Sequence;
2621 for (RegUseTracker::const_iterator I = RegUses.begin(), E = RegUses.end();
2623 const SCEV *Reg = *I;
2624 int64_t Imm = ExtractImmediate(Reg, SE);
2625 std::pair<RegMapTy::iterator, bool> Pair =
2626 Map.insert(std::make_pair(Reg, ImmMapTy()));
2628 Sequence.push_back(Reg);
2629 Pair.first->second.insert(std::make_pair(Imm, *I));
2630 UsedByIndicesMap[Reg] |= RegUses.getUsedByIndices(*I);
2633 // Now examine each set of registers with the same base value. Build up
2634 // a list of work to do and do the work in a separate step so that we're
2635 // not adding formulae and register counts while we're searching.
2636 SmallVector<WorkItem, 32> WorkItems;
2637 SmallSet<std::pair<size_t, int64_t>, 32> UniqueItems;
2638 for (SmallVectorImpl<const SCEV *>::const_iterator I = Sequence.begin(),
2639 E = Sequence.end(); I != E; ++I) {
2640 const SCEV *Reg = *I;
2641 const ImmMapTy &Imms = Map.find(Reg)->second;
2643 // It's not worthwhile looking for reuse if there's only one offset.
2644 if (Imms.size() == 1)
2647 DEBUG(dbgs() << "Generating cross-use offsets for " << *Reg << ':';
2648 for (ImmMapTy::const_iterator J = Imms.begin(), JE = Imms.end();
2650 dbgs() << ' ' << J->first;
2653 // Examine each offset.
2654 for (ImmMapTy::const_iterator J = Imms.begin(), JE = Imms.end();
2656 const SCEV *OrigReg = J->second;
2658 int64_t JImm = J->first;
2659 const SmallBitVector &UsedByIndices = RegUses.getUsedByIndices(OrigReg);
2661 if (!isa<SCEVConstant>(OrigReg) &&
2662 UsedByIndicesMap[Reg].count() == 1) {
2663 DEBUG(dbgs() << "Skipping cross-use reuse for " << *OrigReg << '\n');
2667 // Conservatively examine offsets between this orig reg a few selected
2669 ImmMapTy::const_iterator OtherImms[] = {
2670 Imms.begin(), prior(Imms.end()),
2671 Imms.upper_bound((Imms.begin()->first + prior(Imms.end())->first) / 2)
2673 for (size_t i = 0, e = array_lengthof(OtherImms); i != e; ++i) {
2674 ImmMapTy::const_iterator M = OtherImms[i];
2675 if (M == J || M == JE) continue;
2677 // Compute the difference between the two.
2678 int64_t Imm = (uint64_t)JImm - M->first;
2679 for (int LUIdx = UsedByIndices.find_first(); LUIdx != -1;
2680 LUIdx = UsedByIndices.find_next(LUIdx))
2681 // Make a memo of this use, offset, and register tuple.
2682 if (UniqueItems.insert(std::make_pair(LUIdx, Imm)))
2683 WorkItems.push_back(WorkItem(LUIdx, Imm, OrigReg));
2690 UsedByIndicesMap.clear();
2691 UniqueItems.clear();
2693 // Now iterate through the worklist and add new formulae.
2694 for (SmallVectorImpl<WorkItem>::const_iterator I = WorkItems.begin(),
2695 E = WorkItems.end(); I != E; ++I) {
2696 const WorkItem &WI = *I;
2697 size_t LUIdx = WI.LUIdx;
2698 LSRUse &LU = Uses[LUIdx];
2699 int64_t Imm = WI.Imm;
2700 const SCEV *OrigReg = WI.OrigReg;
2702 const Type *IntTy = SE.getEffectiveSCEVType(OrigReg->getType());
2703 const SCEV *NegImmS = SE.getSCEV(ConstantInt::get(IntTy, -(uint64_t)Imm));
2704 unsigned BitWidth = SE.getTypeSizeInBits(IntTy);
2706 // TODO: Use a more targeted data structure.
2707 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {
2708 const Formula &F = LU.Formulae[L];
2709 // Use the immediate in the scaled register.
2710 if (F.ScaledReg == OrigReg) {
2711 int64_t Offs = (uint64_t)F.AM.BaseOffs +
2712 Imm * (uint64_t)F.AM.Scale;
2713 // Don't create 50 + reg(-50).
2714 if (F.referencesReg(SE.getSCEV(
2715 ConstantInt::get(IntTy, -(uint64_t)Offs))))
2718 NewF.AM.BaseOffs = Offs;
2719 if (!isLegalUse(NewF.AM, LU.MinOffset, LU.MaxOffset,
2720 LU.Kind, LU.AccessTy, TLI))
2722 NewF.ScaledReg = SE.getAddExpr(NegImmS, NewF.ScaledReg);
2724 // If the new scale is a constant in a register, and adding the constant
2725 // value to the immediate would produce a value closer to zero than the
2726 // immediate itself, then the formula isn't worthwhile.
2727 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(NewF.ScaledReg))
2728 if (C->getValue()->getValue().isNegative() !=
2729 (NewF.AM.BaseOffs < 0) &&
2730 (C->getValue()->getValue().abs() * APInt(BitWidth, F.AM.Scale))
2731 .ule(abs64(NewF.AM.BaseOffs)))
2735 (void)InsertFormula(LU, LUIdx, NewF);
2737 // Use the immediate in a base register.
2738 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) {
2739 const SCEV *BaseReg = F.BaseRegs[N];
2740 if (BaseReg != OrigReg)
2743 NewF.AM.BaseOffs = (uint64_t)NewF.AM.BaseOffs + Imm;
2744 if (!isLegalUse(NewF.AM, LU.MinOffset, LU.MaxOffset,
2745 LU.Kind, LU.AccessTy, TLI))
2747 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg);
2749 // If the new formula has a constant in a register, and adding the
2750 // constant value to the immediate would produce a value closer to
2751 // zero than the immediate itself, then the formula isn't worthwhile.
2752 for (SmallVectorImpl<const SCEV *>::const_iterator
2753 J = NewF.BaseRegs.begin(), JE = NewF.BaseRegs.end();
2755 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(*J))
2756 if ((C->getValue()->getValue() + NewF.AM.BaseOffs).abs().slt(
2757 abs64(NewF.AM.BaseOffs)) &&
2758 (C->getValue()->getValue() +
2759 NewF.AM.BaseOffs).countTrailingZeros() >=
2760 CountTrailingZeros_64(NewF.AM.BaseOffs))
2764 (void)InsertFormula(LU, LUIdx, NewF);
2773 /// GenerateAllReuseFormulae - Generate formulae for each use.
2775 LSRInstance::GenerateAllReuseFormulae() {
2776 // This is split into multiple loops so that hasRegsUsedByUsesOtherThan
2777 // queries are more precise.
2778 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2779 LSRUse &LU = Uses[LUIdx];
2780 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2781 GenerateReassociations(LU, LUIdx, LU.Formulae[i]);
2782 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2783 GenerateCombinations(LU, LUIdx, LU.Formulae[i]);
2785 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2786 LSRUse &LU = Uses[LUIdx];
2787 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2788 GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);
2789 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2790 GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);
2791 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2792 GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);
2793 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2794 GenerateScales(LU, LUIdx, LU.Formulae[i]);
2796 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2797 LSRUse &LU = Uses[LUIdx];
2798 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
2799 GenerateTruncates(LU, LUIdx, LU.Formulae[i]);
2802 GenerateCrossUseConstantOffsets();
2804 DEBUG(dbgs() << "\n"
2805 "After generating reuse formulae:\n";
2806 print_uses(dbgs()));
2809 /// If there are multiple formulae with the same set of registers used
2810 /// by other uses, pick the best one and delete the others.
2811 void LSRInstance::FilterOutUndesirableDedicatedRegisters() {
2812 DenseSet<const SCEV *> VisitedRegs;
2813 SmallPtrSet<const SCEV *, 16> Regs;
2815 bool ChangedFormulae = false;
2818 // Collect the best formula for each unique set of shared registers. This
2819 // is reset for each use.
2820 typedef DenseMap<SmallVector<const SCEV *, 2>, size_t, UniquifierDenseMapInfo>
2822 BestFormulaeTy BestFormulae;
2824 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2825 LSRUse &LU = Uses[LUIdx];
2826 DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs()); dbgs() << '\n');
2829 for (size_t FIdx = 0, NumForms = LU.Formulae.size();
2830 FIdx != NumForms; ++FIdx) {
2831 Formula &F = LU.Formulae[FIdx];
2833 SmallVector<const SCEV *, 2> Key;
2834 for (SmallVectorImpl<const SCEV *>::const_iterator J = F.BaseRegs.begin(),
2835 JE = F.BaseRegs.end(); J != JE; ++J) {
2836 const SCEV *Reg = *J;
2837 if (RegUses.isRegUsedByUsesOtherThan(Reg, LUIdx))
2841 RegUses.isRegUsedByUsesOtherThan(F.ScaledReg, LUIdx))
2842 Key.push_back(F.ScaledReg);
2843 // Unstable sort by host order ok, because this is only used for
2845 std::sort(Key.begin(), Key.end());
2847 std::pair<BestFormulaeTy::const_iterator, bool> P =
2848 BestFormulae.insert(std::make_pair(Key, FIdx));
2850 Formula &Best = LU.Formulae[P.first->second];
2853 CostF.RateFormula(F, Regs, VisitedRegs, L, LU.Offsets, SE, DT);
2856 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT);
2858 if (CostF < CostBest)
2860 DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
2862 " in favor of formula "; Best.print(dbgs());
2865 ChangedFormulae = true;
2867 LU.DeleteFormula(F);
2875 // Now that we've filtered out some formulae, recompute the Regs set.
2877 LU.RecomputeRegs(LUIdx, RegUses);
2879 // Reset this to prepare for the next use.
2880 BestFormulae.clear();
2883 DEBUG(if (ChangedFormulae) {
2885 "After filtering out undesirable candidates:\n";
2890 // This is a rough guess that seems to work fairly well.
2891 static const size_t ComplexityLimit = UINT16_MAX;
2893 /// EstimateSearchSpaceComplexity - Estimate the worst-case number of
2894 /// solutions the solver might have to consider. It almost never considers
2895 /// this many solutions because it prune the search space, but the pruning
2896 /// isn't always sufficient.
2897 size_t LSRInstance::EstimateSearchSpaceComplexity() const {
2899 for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
2900 E = Uses.end(); I != E; ++I) {
2901 size_t FSize = I->Formulae.size();
2902 if (FSize >= ComplexityLimit) {
2903 Power = ComplexityLimit;
2907 if (Power >= ComplexityLimit)
2913 /// NarrowSearchSpaceByDetectingSupersets - When one formula uses a superset
2914 /// of the registers of another formula, it won't help reduce register
2915 /// pressure (though it may not necessarily hurt register pressure); remove
2916 /// it to simplify the system.
2917 void LSRInstance::NarrowSearchSpaceByDetectingSupersets() {
2918 if (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
2919 DEBUG(dbgs() << "The search space is too complex.\n");
2921 DEBUG(dbgs() << "Narrowing the search space by eliminating formulae "
2922 "which use a superset of registers used by other "
2925 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2926 LSRUse &LU = Uses[LUIdx];
2928 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
2929 Formula &F = LU.Formulae[i];
2930 // Look for a formula with a constant or GV in a register. If the use
2931 // also has a formula with that same value in an immediate field,
2932 // delete the one that uses a register.
2933 for (SmallVectorImpl<const SCEV *>::const_iterator
2934 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) {
2935 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(*I)) {
2937 NewF.AM.BaseOffs += C->getValue()->getSExtValue();
2938 NewF.BaseRegs.erase(NewF.BaseRegs.begin() +
2939 (I - F.BaseRegs.begin()));
2940 if (LU.HasFormulaWithSameRegs(NewF)) {
2941 DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
2942 LU.DeleteFormula(F);
2948 } else if (const SCEVUnknown *U = dyn_cast<SCEVUnknown>(*I)) {
2949 if (GlobalValue *GV = dyn_cast<GlobalValue>(U->getValue()))
2952 NewF.AM.BaseGV = GV;
2953 NewF.BaseRegs.erase(NewF.BaseRegs.begin() +
2954 (I - F.BaseRegs.begin()));
2955 if (LU.HasFormulaWithSameRegs(NewF)) {
2956 DEBUG(dbgs() << " Deleting "; F.print(dbgs());
2958 LU.DeleteFormula(F);
2969 LU.RecomputeRegs(LUIdx, RegUses);
2972 DEBUG(dbgs() << "After pre-selection:\n";
2973 print_uses(dbgs()));
2977 /// NarrowSearchSpaceByCollapsingUnrolledCode - When there are many registers
2978 /// for expressions like A, A+1, A+2, etc., allocate a single register for
2980 void LSRInstance::NarrowSearchSpaceByCollapsingUnrolledCode() {
2981 if (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
2982 DEBUG(dbgs() << "The search space is too complex.\n");
2984 DEBUG(dbgs() << "Narrowing the search space by assuming that uses "
2985 "separated by a constant offset will use the same "
2988 // This is especially useful for unrolled loops.
2990 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2991 LSRUse &LU = Uses[LUIdx];
2992 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(),
2993 E = LU.Formulae.end(); I != E; ++I) {
2994 const Formula &F = *I;
2995 if (F.AM.BaseOffs != 0 && F.AM.Scale == 0) {
2996 if (LSRUse *LUThatHas = FindUseWithSimilarFormula(F, LU)) {
2997 if (reconcileNewOffset(*LUThatHas, F.AM.BaseOffs,
2998 /*HasBaseReg=*/false,
2999 LU.Kind, LU.AccessTy)) {
3000 DEBUG(dbgs() << " Deleting use "; LU.print(dbgs());
3003 LUThatHas->AllFixupsOutsideLoop &= LU.AllFixupsOutsideLoop;
3005 // Update the relocs to reference the new use.
3006 for (SmallVectorImpl<LSRFixup>::iterator I = Fixups.begin(),
3007 E = Fixups.end(); I != E; ++I) {
3008 LSRFixup &Fixup = *I;
3009 if (Fixup.LUIdx == LUIdx) {
3010 Fixup.LUIdx = LUThatHas - &Uses.front();
3011 Fixup.Offset += F.AM.BaseOffs;
3012 // Add the new offset to LUThatHas' offset list.
3013 if (LUThatHas->Offsets.back() != Fixup.Offset) {
3014 LUThatHas->Offsets.push_back(Fixup.Offset);
3015 if (Fixup.Offset > LUThatHas->MaxOffset)
3016 LUThatHas->MaxOffset = Fixup.Offset;
3017 if (Fixup.Offset < LUThatHas->MinOffset)
3018 LUThatHas->MinOffset = Fixup.Offset;
3020 DEBUG(dbgs() << "New fixup has offset "
3021 << Fixup.Offset << '\n');
3023 if (Fixup.LUIdx == NumUses-1)
3024 Fixup.LUIdx = LUIdx;
3027 // Delete formulae from the new use which are no longer legal.
3029 for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {
3030 Formula &F = LUThatHas->Formulae[i];
3031 if (!isLegalUse(F.AM,
3032 LUThatHas->MinOffset, LUThatHas->MaxOffset,
3033 LUThatHas->Kind, LUThatHas->AccessTy, TLI)) {
3034 DEBUG(dbgs() << " Deleting "; F.print(dbgs());
3036 LUThatHas->DeleteFormula(F);
3043 LUThatHas->RecomputeRegs(LUThatHas - &Uses.front(), RegUses);
3045 // Delete the old use.
3046 DeleteUse(LU, LUIdx);
3056 DEBUG(dbgs() << "After pre-selection:\n";
3057 print_uses(dbgs()));
3061 /// NarrowSearchSpaceByRefilteringUndesirableDedicatedRegisters - Call
3062 /// FilterOutUndesirableDedicatedRegisters again, if necessary, now that
3063 /// we've done more filtering, as it may be able to find more formulae to
3065 void LSRInstance::NarrowSearchSpaceByRefilteringUndesirableDedicatedRegisters(){
3066 if (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
3067 DEBUG(dbgs() << "The search space is too complex.\n");
3069 DEBUG(dbgs() << "Narrowing the search space by re-filtering out "
3070 "undesirable dedicated registers.\n");
3072 FilterOutUndesirableDedicatedRegisters();
3074 DEBUG(dbgs() << "After pre-selection:\n";
3075 print_uses(dbgs()));
3079 /// NarrowSearchSpaceByPickingWinnerRegs - Pick a register which seems likely
3080 /// to be profitable, and then in any use which has any reference to that
3081 /// register, delete all formulae which do not reference that register.
3082 void LSRInstance::NarrowSearchSpaceByPickingWinnerRegs() {
3083 // With all other options exhausted, loop until the system is simple
3084 // enough to handle.
3085 SmallPtrSet<const SCEV *, 4> Taken;
3086 while (EstimateSearchSpaceComplexity() >= ComplexityLimit) {
3087 // Ok, we have too many of formulae on our hands to conveniently handle.
3088 // Use a rough heuristic to thin out the list.
3089 DEBUG(dbgs() << "The search space is too complex.\n");
3091 // Pick the register which is used by the most LSRUses, which is likely
3092 // to be a good reuse register candidate.
3093 const SCEV *Best = 0;
3094 unsigned BestNum = 0;
3095 for (RegUseTracker::const_iterator I = RegUses.begin(), E = RegUses.end();
3097 const SCEV *Reg = *I;
3098 if (Taken.count(Reg))
3103 unsigned Count = RegUses.getUsedByIndices(Reg).count();
3104 if (Count > BestNum) {
3111 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
3112 << " will yield profitable reuse.\n");
3115 // In any use with formulae which references this register, delete formulae
3116 // which don't reference it.
3117 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3118 LSRUse &LU = Uses[LUIdx];
3119 if (!LU.Regs.count(Best)) continue;
3122 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
3123 Formula &F = LU.Formulae[i];
3124 if (!F.referencesReg(Best)) {
3125 DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
3126 LU.DeleteFormula(F);
3130 assert(e != 0 && "Use has no formulae left! Is Regs inconsistent?");
3136 LU.RecomputeRegs(LUIdx, RegUses);
3139 DEBUG(dbgs() << "After pre-selection:\n";
3140 print_uses(dbgs()));
3144 /// NarrowSearchSpaceUsingHeuristics - If there are an extraordinary number of
3145 /// formulae to choose from, use some rough heuristics to prune down the number
3146 /// of formulae. This keeps the main solver from taking an extraordinary amount
3147 /// of time in some worst-case scenarios.
3148 void LSRInstance::NarrowSearchSpaceUsingHeuristics() {
3149 NarrowSearchSpaceByDetectingSupersets();
3150 NarrowSearchSpaceByCollapsingUnrolledCode();
3151 NarrowSearchSpaceByRefilteringUndesirableDedicatedRegisters();
3152 NarrowSearchSpaceByPickingWinnerRegs();
3155 /// SolveRecurse - This is the recursive solver.
3156 void LSRInstance::SolveRecurse(SmallVectorImpl<const Formula *> &Solution,
3158 SmallVectorImpl<const Formula *> &Workspace,
3159 const Cost &CurCost,
3160 const SmallPtrSet<const SCEV *, 16> &CurRegs,
3161 DenseSet<const SCEV *> &VisitedRegs) const {
3164 // - use more aggressive filtering
3165 // - sort the formula so that the most profitable solutions are found first
3166 // - sort the uses too
3168 // - don't compute a cost, and then compare. compare while computing a cost
3170 // - track register sets with SmallBitVector
3172 const LSRUse &LU = Uses[Workspace.size()];
3174 // If this use references any register that's already a part of the
3175 // in-progress solution, consider it a requirement that a formula must
3176 // reference that register in order to be considered. This prunes out
3177 // unprofitable searching.
3178 SmallSetVector<const SCEV *, 4> ReqRegs;
3179 for (SmallPtrSet<const SCEV *, 16>::const_iterator I = CurRegs.begin(),
3180 E = CurRegs.end(); I != E; ++I)
3181 if (LU.Regs.count(*I))
3184 bool AnySatisfiedReqRegs = false;
3185 SmallPtrSet<const SCEV *, 16> NewRegs;
3188 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(),
3189 E = LU.Formulae.end(); I != E; ++I) {
3190 const Formula &F = *I;
3192 // Ignore formulae which do not use any of the required registers.
3193 for (SmallSetVector<const SCEV *, 4>::const_iterator J = ReqRegs.begin(),
3194 JE = ReqRegs.end(); J != JE; ++J) {
3195 const SCEV *Reg = *J;
3196 if ((!F.ScaledReg || F.ScaledReg != Reg) &&
3197 std::find(F.BaseRegs.begin(), F.BaseRegs.end(), Reg) ==
3201 AnySatisfiedReqRegs = true;
3203 // Evaluate the cost of the current formula. If it's already worse than
3204 // the current best, prune the search at that point.
3207 NewCost.RateFormula(F, NewRegs, VisitedRegs, L, LU.Offsets, SE, DT);
3208 if (NewCost < SolutionCost) {
3209 Workspace.push_back(&F);
3210 if (Workspace.size() != Uses.size()) {
3211 SolveRecurse(Solution, SolutionCost, Workspace, NewCost,
3212 NewRegs, VisitedRegs);
3213 if (F.getNumRegs() == 1 && Workspace.size() == 1)
3214 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]);
3216 DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
3217 dbgs() << ". Regs:";
3218 for (SmallPtrSet<const SCEV *, 16>::const_iterator
3219 I = NewRegs.begin(), E = NewRegs.end(); I != E; ++I)
3220 dbgs() << ' ' << **I;
3223 SolutionCost = NewCost;
3224 Solution = Workspace;
3226 Workspace.pop_back();
3231 // If none of the formulae had all of the required registers, relax the
3232 // constraint so that we don't exclude all formulae.
3233 if (!AnySatisfiedReqRegs) {
3234 assert(!ReqRegs.empty() && "Solver failed even without required registers");
3240 /// Solve - Choose one formula from each use. Return the results in the given
3241 /// Solution vector.
3242 void LSRInstance::Solve(SmallVectorImpl<const Formula *> &Solution) const {
3243 SmallVector<const Formula *, 8> Workspace;
3245 SolutionCost.Loose();
3247 SmallPtrSet<const SCEV *, 16> CurRegs;
3248 DenseSet<const SCEV *> VisitedRegs;
3249 Workspace.reserve(Uses.size());
3251 // SolveRecurse does all the work.
3252 SolveRecurse(Solution, SolutionCost, Workspace, CurCost,
3253 CurRegs, VisitedRegs);
3255 // Ok, we've now made all our decisions.
3256 DEBUG(dbgs() << "\n"
3257 "The chosen solution requires "; SolutionCost.print(dbgs());
3259 for (size_t i = 0, e = Uses.size(); i != e; ++i) {
3261 Uses[i].print(dbgs());
3264 Solution[i]->print(dbgs());
3268 assert(Solution.size() == Uses.size() && "Malformed solution!");
3271 /// HoistInsertPosition - Helper for AdjustInsertPositionForExpand. Climb up
3272 /// the dominator tree far as we can go while still being dominated by the
3273 /// input positions. This helps canonicalize the insert position, which
3274 /// encourages sharing.
3275 BasicBlock::iterator
3276 LSRInstance::HoistInsertPosition(BasicBlock::iterator IP,
3277 const SmallVectorImpl<Instruction *> &Inputs)
3280 const Loop *IPLoop = LI.getLoopFor(IP->getParent());
3281 unsigned IPLoopDepth = IPLoop ? IPLoop->getLoopDepth() : 0;
3284 for (DomTreeNode *Rung = DT.getNode(IP->getParent()); ; ) {
3285 if (!Rung) return IP;
3286 Rung = Rung->getIDom();
3287 if (!Rung) return IP;
3288 IDom = Rung->getBlock();
3290 // Don't climb into a loop though.
3291 const Loop *IDomLoop = LI.getLoopFor(IDom);
3292 unsigned IDomDepth = IDomLoop ? IDomLoop->getLoopDepth() : 0;
3293 if (IDomDepth <= IPLoopDepth &&
3294 (IDomDepth != IPLoopDepth || IDomLoop == IPLoop))
3298 bool AllDominate = true;
3299 Instruction *BetterPos = 0;
3300 Instruction *Tentative = IDom->getTerminator();
3301 for (SmallVectorImpl<Instruction *>::const_iterator I = Inputs.begin(),
3302 E = Inputs.end(); I != E; ++I) {
3303 Instruction *Inst = *I;
3304 if (Inst == Tentative || !DT.dominates(Inst, Tentative)) {
3305 AllDominate = false;
3308 // Attempt to find an insert position in the middle of the block,
3309 // instead of at the end, so that it can be used for other expansions.
3310 if (IDom == Inst->getParent() &&
3311 (!BetterPos || DT.dominates(BetterPos, Inst)))
3312 BetterPos = llvm::next(BasicBlock::iterator(Inst));
3325 /// AdjustInsertPositionForExpand - Determine an input position which will be
3326 /// dominated by the operands and which will dominate the result.
3327 BasicBlock::iterator
3328 LSRInstance::AdjustInsertPositionForExpand(BasicBlock::iterator IP,
3330 const LSRUse &LU) const {
3331 // Collect some instructions which must be dominated by the
3332 // expanding replacement. These must be dominated by any operands that
3333 // will be required in the expansion.
3334 SmallVector<Instruction *, 4> Inputs;
3335 if (Instruction *I = dyn_cast<Instruction>(LF.OperandValToReplace))
3336 Inputs.push_back(I);
3337 if (LU.Kind == LSRUse::ICmpZero)
3338 if (Instruction *I =
3339 dyn_cast<Instruction>(cast<ICmpInst>(LF.UserInst)->getOperand(1)))
3340 Inputs.push_back(I);
3341 if (LF.PostIncLoops.count(L)) {
3342 if (LF.isUseFullyOutsideLoop(L))
3343 Inputs.push_back(L->getLoopLatch()->getTerminator());
3345 Inputs.push_back(IVIncInsertPos);
3347 // The expansion must also be dominated by the increment positions of any
3348 // loops it for which it is using post-inc mode.
3349 for (PostIncLoopSet::const_iterator I = LF.PostIncLoops.begin(),
3350 E = LF.PostIncLoops.end(); I != E; ++I) {
3351 const Loop *PIL = *I;
3352 if (PIL == L) continue;
3354 // Be dominated by the loop exit.
3355 SmallVector<BasicBlock *, 4> ExitingBlocks;
3356 PIL->getExitingBlocks(ExitingBlocks);
3357 if (!ExitingBlocks.empty()) {
3358 BasicBlock *BB = ExitingBlocks[0];
3359 for (unsigned i = 1, e = ExitingBlocks.size(); i != e; ++i)
3360 BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]);
3361 Inputs.push_back(BB->getTerminator());
3365 // Then, climb up the immediate dominator tree as far as we can go while
3366 // still being dominated by the input positions.
3367 IP = HoistInsertPosition(IP, Inputs);
3369 // Don't insert instructions before PHI nodes.
3370 while (isa<PHINode>(IP)) ++IP;
3372 // Ignore debug intrinsics.
3373 while (isa<DbgInfoIntrinsic>(IP)) ++IP;
3378 /// Expand - Emit instructions for the leading candidate expression for this
3379 /// LSRUse (this is called "expanding").
3380 Value *LSRInstance::Expand(const LSRFixup &LF,
3382 BasicBlock::iterator IP,
3383 SCEVExpander &Rewriter,
3384 SmallVectorImpl<WeakVH> &DeadInsts) const {
3385 const LSRUse &LU = Uses[LF.LUIdx];
3387 // Determine an input position which will be dominated by the operands and
3388 // which will dominate the result.
3389 IP = AdjustInsertPositionForExpand(IP, LF, LU);
3391 // Inform the Rewriter if we have a post-increment use, so that it can
3392 // perform an advantageous expansion.
3393 Rewriter.setPostInc(LF.PostIncLoops);
3395 // This is the type that the user actually needs.
3396 const Type *OpTy = LF.OperandValToReplace->getType();
3397 // This will be the type that we'll initially expand to.
3398 const Type *Ty = F.getType();
3400 // No type known; just expand directly to the ultimate type.
3402 else if (SE.getEffectiveSCEVType(Ty) == SE.getEffectiveSCEVType(OpTy))
3403 // Expand directly to the ultimate type if it's the right size.
3405 // This is the type to do integer arithmetic in.
3406 const Type *IntTy = SE.getEffectiveSCEVType(Ty);
3408 // Build up a list of operands to add together to form the full base.
3409 SmallVector<const SCEV *, 8> Ops;
3411 // Expand the BaseRegs portion.
3412 for (SmallVectorImpl<const SCEV *>::const_iterator I = F.BaseRegs.begin(),
3413 E = F.BaseRegs.end(); I != E; ++I) {
3414 const SCEV *Reg = *I;
3415 assert(!Reg->isZero() && "Zero allocated in a base register!");
3417 // If we're expanding for a post-inc user, make the post-inc adjustment.
3418 PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops);
3419 Reg = TransformForPostIncUse(Denormalize, Reg,
3420 LF.UserInst, LF.OperandValToReplace,
3423 Ops.push_back(SE.getUnknown(Rewriter.expandCodeFor(Reg, 0, IP)));
3426 // Flush the operand list to suppress SCEVExpander hoisting.
3428 Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP);
3430 Ops.push_back(SE.getUnknown(FullV));
3433 // Expand the ScaledReg portion.
3434 Value *ICmpScaledV = 0;
3435 if (F.AM.Scale != 0) {
3436 const SCEV *ScaledS = F.ScaledReg;
3438 // If we're expanding for a post-inc user, make the post-inc adjustment.
3439 PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops);
3440 ScaledS = TransformForPostIncUse(Denormalize, ScaledS,
3441 LF.UserInst, LF.OperandValToReplace,
3444 if (LU.Kind == LSRUse::ICmpZero) {
3445 // An interesting way of "folding" with an icmp is to use a negated
3446 // scale, which we'll implement by inserting it into the other operand
3448 assert(F.AM.Scale == -1 &&
3449 "The only scale supported by ICmpZero uses is -1!");
3450 ICmpScaledV = Rewriter.expandCodeFor(ScaledS, 0, IP);
3452 // Otherwise just expand the scaled register and an explicit scale,
3453 // which is expected to be matched as part of the address.
3454 ScaledS = SE.getUnknown(Rewriter.expandCodeFor(ScaledS, 0, IP));
3455 ScaledS = SE.getMulExpr(ScaledS,
3456 SE.getConstant(ScaledS->getType(), F.AM.Scale));
3457 Ops.push_back(ScaledS);
3459 // Flush the operand list to suppress SCEVExpander hoisting.
3460 Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP);
3462 Ops.push_back(SE.getUnknown(FullV));
3466 // Expand the GV portion.
3468 Ops.push_back(SE.getUnknown(F.AM.BaseGV));
3470 // Flush the operand list to suppress SCEVExpander hoisting.
3471 Value *FullV = Rewriter.expandCodeFor(SE.getAddExpr(Ops), Ty, IP);
3473 Ops.push_back(SE.getUnknown(FullV));
3476 // Expand the immediate portion.
3477 int64_t Offset = (uint64_t)F.AM.BaseOffs + LF.Offset;
3479 if (LU.Kind == LSRUse::ICmpZero) {
3480 // The other interesting way of "folding" with an ICmpZero is to use a
3481 // negated immediate.
3483 ICmpScaledV = ConstantInt::get(IntTy, -Offset);
3485 Ops.push_back(SE.getUnknown(ICmpScaledV));
3486 ICmpScaledV = ConstantInt::get(IntTy, Offset);
3489 // Just add the immediate values. These again are expected to be matched
3490 // as part of the address.
3491 Ops.push_back(SE.getUnknown(ConstantInt::getSigned(IntTy, Offset)));
3495 // Emit instructions summing all the operands.
3496 const SCEV *FullS = Ops.empty() ?
3497 SE.getConstant(IntTy, 0) :
3499 Value *FullV = Rewriter.expandCodeFor(FullS, Ty, IP);
3501 // We're done expanding now, so reset the rewriter.
3502 Rewriter.clearPostInc();
3504 // An ICmpZero Formula represents an ICmp which we're handling as a
3505 // comparison against zero. Now that we've expanded an expression for that
3506 // form, update the ICmp's other operand.
3507 if (LU.Kind == LSRUse::ICmpZero) {
3508 ICmpInst *CI = cast<ICmpInst>(LF.UserInst);
3509 DeadInsts.push_back(CI->getOperand(1));
3510 assert(!F.AM.BaseGV && "ICmp does not support folding a global value and "
3511 "a scale at the same time!");
3512 if (F.AM.Scale == -1) {
3513 if (ICmpScaledV->getType() != OpTy) {
3515 CastInst::Create(CastInst::getCastOpcode(ICmpScaledV, false,
3517 ICmpScaledV, OpTy, "tmp", CI);
3520 CI->setOperand(1, ICmpScaledV);
3522 assert(F.AM.Scale == 0 &&
3523 "ICmp does not support folding a global value and "
3524 "a scale at the same time!");
3525 Constant *C = ConstantInt::getSigned(SE.getEffectiveSCEVType(OpTy),
3527 if (C->getType() != OpTy)
3528 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
3532 CI->setOperand(1, C);
3539 /// RewriteForPHI - Helper for Rewrite. PHI nodes are special because the use
3540 /// of their operands effectively happens in their predecessor blocks, so the
3541 /// expression may need to be expanded in multiple places.
3542 void LSRInstance::RewriteForPHI(PHINode *PN,
3545 SCEVExpander &Rewriter,
3546 SmallVectorImpl<WeakVH> &DeadInsts,
3548 DenseMap<BasicBlock *, Value *> Inserted;
3549 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
3550 if (PN->getIncomingValue(i) == LF.OperandValToReplace) {
3551 BasicBlock *BB = PN->getIncomingBlock(i);
3553 // If this is a critical edge, split the edge so that we do not insert
3554 // the code on all predecessor/successor paths. We do this unless this
3555 // is the canonical backedge for this loop, which complicates post-inc
3557 if (e != 1 && BB->getTerminator()->getNumSuccessors() > 1 &&
3558 !isa<IndirectBrInst>(BB->getTerminator())) {
3559 Loop *PNLoop = LI.getLoopFor(PN->getParent());
3560 if (!PNLoop || PN->getParent() != PNLoop->getHeader()) {
3561 // Split the critical edge.
3562 BasicBlock *NewBB = SplitCriticalEdge(BB, PN->getParent(), P);
3564 // If PN is outside of the loop and BB is in the loop, we want to
3565 // move the block to be immediately before the PHI block, not
3566 // immediately after BB.
3567 if (L->contains(BB) && !L->contains(PN))
3568 NewBB->moveBefore(PN->getParent());
3570 // Splitting the edge can reduce the number of PHI entries we have.
3571 e = PN->getNumIncomingValues();
3573 i = PN->getBasicBlockIndex(BB);
3577 std::pair<DenseMap<BasicBlock *, Value *>::iterator, bool> Pair =
3578 Inserted.insert(std::make_pair(BB, static_cast<Value *>(0)));
3580 PN->setIncomingValue(i, Pair.first->second);
3582 Value *FullV = Expand(LF, F, BB->getTerminator(), Rewriter, DeadInsts);
3584 // If this is reuse-by-noop-cast, insert the noop cast.
3585 const Type *OpTy = LF.OperandValToReplace->getType();
3586 if (FullV->getType() != OpTy)
3588 CastInst::Create(CastInst::getCastOpcode(FullV, false,
3590 FullV, LF.OperandValToReplace->getType(),
3591 "tmp", BB->getTerminator());
3593 PN->setIncomingValue(i, FullV);
3594 Pair.first->second = FullV;
3599 /// Rewrite - Emit instructions for the leading candidate expression for this
3600 /// LSRUse (this is called "expanding"), and update the UserInst to reference
3601 /// the newly expanded value.
3602 void LSRInstance::Rewrite(const LSRFixup &LF,
3604 SCEVExpander &Rewriter,
3605 SmallVectorImpl<WeakVH> &DeadInsts,
3607 // First, find an insertion point that dominates UserInst. For PHI nodes,
3608 // find the nearest block which dominates all the relevant uses.
3609 if (PHINode *PN = dyn_cast<PHINode>(LF.UserInst)) {
3610 RewriteForPHI(PN, LF, F, Rewriter, DeadInsts, P);
3612 Value *FullV = Expand(LF, F, LF.UserInst, Rewriter, DeadInsts);
3614 // If this is reuse-by-noop-cast, insert the noop cast.
3615 const Type *OpTy = LF.OperandValToReplace->getType();
3616 if (FullV->getType() != OpTy) {
3618 CastInst::Create(CastInst::getCastOpcode(FullV, false, OpTy, false),
3619 FullV, OpTy, "tmp", LF.UserInst);
3623 // Update the user. ICmpZero is handled specially here (for now) because
3624 // Expand may have updated one of the operands of the icmp already, and
3625 // its new value may happen to be equal to LF.OperandValToReplace, in
3626 // which case doing replaceUsesOfWith leads to replacing both operands
3627 // with the same value. TODO: Reorganize this.
3628 if (Uses[LF.LUIdx].Kind == LSRUse::ICmpZero)
3629 LF.UserInst->setOperand(0, FullV);
3631 LF.UserInst->replaceUsesOfWith(LF.OperandValToReplace, FullV);
3634 DeadInsts.push_back(LF.OperandValToReplace);
3637 /// ImplementSolution - Rewrite all the fixup locations with new values,
3638 /// following the chosen solution.
3640 LSRInstance::ImplementSolution(const SmallVectorImpl<const Formula *> &Solution,
3642 // Keep track of instructions we may have made dead, so that
3643 // we can remove them after we are done working.
3644 SmallVector<WeakVH, 16> DeadInsts;
3646 SCEVExpander Rewriter(SE);
3647 Rewriter.disableCanonicalMode();
3648 Rewriter.setIVIncInsertPos(L, IVIncInsertPos);
3650 // Expand the new value definitions and update the users.
3651 for (SmallVectorImpl<LSRFixup>::const_iterator I = Fixups.begin(),
3652 E = Fixups.end(); I != E; ++I) {
3653 const LSRFixup &Fixup = *I;
3655 Rewrite(Fixup, *Solution[Fixup.LUIdx], Rewriter, DeadInsts, P);
3660 // Clean up after ourselves. This must be done before deleting any
3664 Changed |= DeleteTriviallyDeadInstructions(DeadInsts);
3667 LSRInstance::LSRInstance(const TargetLowering *tli, Loop *l, Pass *P)
3668 : IU(P->getAnalysis<IVUsers>()),
3669 SE(P->getAnalysis<ScalarEvolution>()),
3670 DT(P->getAnalysis<DominatorTree>()),
3671 LI(P->getAnalysis<LoopInfo>()),
3672 TLI(tli), L(l), Changed(false), IVIncInsertPos(0) {
3674 // If LoopSimplify form is not available, stay out of trouble.
3675 if (!L->isLoopSimplifyForm()) return;
3677 // If there's no interesting work to be done, bail early.
3678 if (IU.empty()) return;
3680 DEBUG(dbgs() << "\nLSR on loop ";
3681 WriteAsOperand(dbgs(), L->getHeader(), /*PrintType=*/false);
3684 // First, perform some low-level loop optimizations.
3686 OptimizeLoopTermCond();
3688 // Start collecting data and preparing for the solver.
3689 CollectInterestingTypesAndFactors();
3690 CollectFixupsAndInitialFormulae();
3691 CollectLoopInvariantFixupsAndFormulae();
3693 DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
3694 print_uses(dbgs()));
3696 // Now use the reuse data to generate a bunch of interesting ways
3697 // to formulate the values needed for the uses.
3698 GenerateAllReuseFormulae();
3700 FilterOutUndesirableDedicatedRegisters();
3701 NarrowSearchSpaceUsingHeuristics();
3703 SmallVector<const Formula *, 8> Solution;
3706 // Release memory that is no longer needed.
3712 // Formulae should be legal.
3713 for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
3714 E = Uses.end(); I != E; ++I) {
3715 const LSRUse &LU = *I;
3716 for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(),
3717 JE = LU.Formulae.end(); J != JE; ++J)
3718 assert(isLegalUse(J->AM, LU.MinOffset, LU.MaxOffset,
3719 LU.Kind, LU.AccessTy, TLI) &&
3720 "Illegal formula generated!");
3724 // Now that we've decided what we want, make it so.
3725 ImplementSolution(Solution, P);
3728 void LSRInstance::print_factors_and_types(raw_ostream &OS) const {
3729 if (Factors.empty() && Types.empty()) return;
3731 OS << "LSR has identified the following interesting factors and types: ";
3734 for (SmallSetVector<int64_t, 8>::const_iterator
3735 I = Factors.begin(), E = Factors.end(); I != E; ++I) {
3736 if (!First) OS << ", ";
3741 for (SmallSetVector<const Type *, 4>::const_iterator
3742 I = Types.begin(), E = Types.end(); I != E; ++I) {
3743 if (!First) OS << ", ";
3745 OS << '(' << **I << ')';
3750 void LSRInstance::print_fixups(raw_ostream &OS) const {
3751 OS << "LSR is examining the following fixup sites:\n";
3752 for (SmallVectorImpl<LSRFixup>::const_iterator I = Fixups.begin(),
3753 E = Fixups.end(); I != E; ++I) {
3760 void LSRInstance::print_uses(raw_ostream &OS) const {
3761 OS << "LSR is examining the following uses:\n";
3762 for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
3763 E = Uses.end(); I != E; ++I) {
3764 const LSRUse &LU = *I;
3768 for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(),
3769 JE = LU.Formulae.end(); J != JE; ++J) {
3777 void LSRInstance::print(raw_ostream &OS) const {
3778 print_factors_and_types(OS);
3783 void LSRInstance::dump() const {
3784 print(errs()); errs() << '\n';
3789 class LoopStrengthReduce : public LoopPass {
3790 /// TLI - Keep a pointer of a TargetLowering to consult for determining
3791 /// transformation profitability.
3792 const TargetLowering *const TLI;
3795 static char ID; // Pass ID, replacement for typeid
3796 explicit LoopStrengthReduce(const TargetLowering *tli = 0);
3799 bool runOnLoop(Loop *L, LPPassManager &LPM);
3800 void getAnalysisUsage(AnalysisUsage &AU) const;
3805 char LoopStrengthReduce::ID = 0;
3806 INITIALIZE_PASS_BEGIN(LoopStrengthReduce, "loop-reduce",
3807 "Loop Strength Reduction", false, false)
3808 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
3809 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution)
3810 INITIALIZE_PASS_DEPENDENCY(IVUsers)
3811 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
3812 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
3813 INITIALIZE_PASS_END(LoopStrengthReduce, "loop-reduce",
3814 "Loop Strength Reduction", false, false)
3817 Pass *llvm::createLoopStrengthReducePass(const TargetLowering *TLI) {
3818 return new LoopStrengthReduce(TLI);
3821 LoopStrengthReduce::LoopStrengthReduce(const TargetLowering *tli)
3822 : LoopPass(ID), TLI(tli) {
3823 initializeLoopStrengthReducePass(*PassRegistry::getPassRegistry());
3826 void LoopStrengthReduce::getAnalysisUsage(AnalysisUsage &AU) const {
3827 // We split critical edges, so we change the CFG. However, we do update
3828 // many analyses if they are around.
3829 AU.addPreservedID(LoopSimplifyID);
3831 AU.addRequired<LoopInfo>();
3832 AU.addPreserved<LoopInfo>();
3833 AU.addRequiredID(LoopSimplifyID);
3834 AU.addRequired<DominatorTree>();
3835 AU.addPreserved<DominatorTree>();
3836 AU.addRequired<ScalarEvolution>();
3837 AU.addPreserved<ScalarEvolution>();
3838 // Requiring LoopSimplify a second time here prevents IVUsers from running
3839 // twice, since LoopSimplify was invalidated by running ScalarEvolution.
3840 AU.addRequiredID(LoopSimplifyID);
3841 AU.addRequired<IVUsers>();
3842 AU.addPreserved<IVUsers>();
3845 bool LoopStrengthReduce::runOnLoop(Loop *L, LPPassManager & /*LPM*/) {
3846 bool Changed = false;
3848 // Run the main LSR transformation.
3849 Changed |= LSRInstance(TLI, L, this).getChanged();
3851 // At this point, it is worth checking to see if any recurrence PHIs are also
3852 // dead, so that we can remove them as well.
3853 Changed |= DeleteDeadPHIs(L->getHeader());