Lines Matching refs:LU
1038 const LSRUse &LU, const Formula &F);
1042 const LSRUse &LU, const Formula &F,
1092 const LSRUse &LU,
1356 const LSRUse &LU, in RateFormula() argument
1390 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(*TTI, LU, F))); in RateFormula()
1394 C.ScaleCost += *getScalingFactorCost(*TTI, LU, F, *L).getValue(); in RateFormula()
1397 for (const LSRFixup &Fixup : LU.Fixups) { in RateFormula()
1408 if (LU.Kind == LSRUse::Address && Offset != 0 && in RateFormula()
1409 !isAMCompletelyFolded(*TTI, LSRUse::Address, LU.AccessTy, F.BaseGV, in RateFormula()
1444 if (LU.Kind == LSRUse::ICmpZero && !F.hasZeroEnd() && in RateFormula()
1451 if (LU.Kind != LSRUse::ICmpZero) in RateFormula()
1775 const LSRUse &LU, const Formula &F) { in isAMCompletelyFolded() argument
1777 if (LU.Kind == LSRUse::Address && TTI.LSRWithInstrQueries()) { in isAMCompletelyFolded()
1778 for (const LSRFixup &Fixup : LU.Fixups) in isAMCompletelyFolded()
1779 if (!isAMCompletelyFolded(TTI, LSRUse::Address, LU.AccessTy, F.BaseGV, in isAMCompletelyFolded()
1786 return isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in isAMCompletelyFolded()
1787 LU.AccessTy, F.BaseGV, F.BaseOffset, F.HasBaseReg, in isAMCompletelyFolded()
1792 const LSRUse &LU, const Formula &F, in getScalingFactorCost() argument
1799 if (!isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in getScalingFactorCost()
1800 LU.AccessTy, F, L)) in getScalingFactorCost()
1803 switch (LU.Kind) { in getScalingFactorCost()
1807 LU.AccessTy.MemTy, F.BaseGV, F.BaseOffset + LU.MinOffset, F.HasBaseReg, in getScalingFactorCost()
1808 F.Scale, LU.AccessTy.AddrSpace); in getScalingFactorCost()
1810 LU.AccessTy.MemTy, F.BaseGV, F.BaseOffset + LU.MaxOffset, F.HasBaseReg, in getScalingFactorCost()
1811 F.Scale, LU.AccessTy.AddrSpace); in getScalingFactorCost()
2012 bool reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
2018 void DeleteUse(LSRUse &LU, size_t LUIdx);
2022 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
2023 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
2025 bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F);
2029 void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base,
2032 void GenerateReassociationsImpl(LSRUse &LU, unsigned LUIdx,
2035 void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base);
2036 void GenerateSymbolicOffsetsImpl(LSRUse &LU, unsigned LUIdx,
2039 void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
2040 void GenerateConstantOffsetsImpl(LSRUse &LU, unsigned LUIdx,
2044 void GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
2045 void GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base);
2046 void GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base);
2047 void GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base);
2076 const LSRUse &LU) const;
2078 Value *Expand(const LSRUse &LU, const LSRFixup &LF, const Formula &F,
2081 void RewriteForPHI(PHINode *PN, const LSRUse &LU, const LSRFixup &LF,
2084 void Rewrite(const LSRUse &LU, const LSRFixup &LF, const Formula &F,
2558 bool LSRInstance::reconcileNewOffset(LSRUse &LU, int64_t NewOffset, in reconcileNewOffset() argument
2561 int64_t NewMinOffset = LU.MinOffset; in reconcileNewOffset()
2562 int64_t NewMaxOffset = LU.MaxOffset; in reconcileNewOffset()
2568 if (LU.Kind != Kind) in reconcileNewOffset()
2575 if (AccessTy.MemTy != LU.AccessTy.MemTy) { in reconcileNewOffset()
2582 if (NewOffset < LU.MinOffset) { in reconcileNewOffset()
2584 LU.MaxOffset - NewOffset, HasBaseReg)) in reconcileNewOffset()
2587 } else if (NewOffset > LU.MaxOffset) { in reconcileNewOffset()
2589 NewOffset - LU.MinOffset, HasBaseReg)) in reconcileNewOffset()
2595 LU.MinOffset = NewMinOffset; in reconcileNewOffset()
2596 LU.MaxOffset = NewMaxOffset; in reconcileNewOffset()
2597 LU.AccessTy = NewAccessTy; in reconcileNewOffset()
2622 LSRUse &LU = Uses[LUIdx]; in getUse() local
2623 if (reconcileNewOffset(LU, Offset, /*HasBaseReg=*/true, Kind, AccessTy)) in getUse()
2632 LSRUse &LU = Uses[LUIdx]; in getUse() local
2634 LU.MinOffset = Offset; in getUse()
2635 LU.MaxOffset = Offset; in getUse()
2640 void LSRInstance::DeleteUse(LSRUse &LU, size_t LUIdx) { in DeleteUse() argument
2641 if (&LU != &Uses.back()) in DeleteUse()
2642 std::swap(LU, Uses.back()); in DeleteUse()
2656 LSRUse &LU = Uses[LUIdx]; in FindUseWithSimilarFormula() local
2662 if (&LU != &OrigLU && in FindUseWithSimilarFormula()
2663 LU.Kind != LSRUse::ICmpZero && in FindUseWithSimilarFormula()
2664 LU.Kind == OrigLU.Kind && OrigLU.AccessTy == LU.AccessTy && in FindUseWithSimilarFormula()
2665 LU.WidestFixupType == OrigLU.WidestFixupType && in FindUseWithSimilarFormula()
2666 LU.HasFormulaWithSameRegs(OrigF)) { in FindUseWithSimilarFormula()
2668 for (const Formula &F : LU.Formulae) { in FindUseWithSimilarFormula()
2677 return &LU; in FindUseWithSimilarFormula()
3374 LSRUse &LU = Uses[LUIdx]; in CollectFixupsAndInitialFormulae() local
3377 LSRFixup &LF = LU.getNewFixup(); in CollectFixupsAndInitialFormulae()
3382 LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L); in CollectFixupsAndInitialFormulae()
3384 if (!LU.WidestFixupType || in CollectFixupsAndInitialFormulae()
3385 SE.getTypeSizeInBits(LU.WidestFixupType) < in CollectFixupsAndInitialFormulae()
3387 LU.WidestFixupType = LF.OperandValToReplace->getType(); in CollectFixupsAndInitialFormulae()
3390 if (LU.Formulae.empty()) { in CollectFixupsAndInitialFormulae()
3391 InsertInitialFormula(S, LU, LUIdx); in CollectFixupsAndInitialFormulae()
3392 CountRegisters(LU.Formulae.back(), LUIdx); in CollectFixupsAndInitialFormulae()
3401 void LSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, in InsertInitialFormula() argument
3405 LU.RigidFormula = true; in InsertInitialFormula()
3409 bool Inserted = InsertFormula(LU, LUIdx, F); in InsertInitialFormula()
3417 LSRUse &LU, size_t LUIdx) { in InsertSupplementalFormula() argument
3421 bool Inserted = InsertFormula(LU, LUIdx, F); in InsertSupplementalFormula()
3435 bool LSRInstance::InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) { in InsertFormula() argument
3437 assert(isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F) && in InsertFormula()
3440 if (!LU.InsertFormula(F, *L)) in InsertFormula()
3554 LSRUse &LU = Uses[LUIdx]; in CollectLoopInvariantFixupsAndFormulae() local
3555 LSRFixup &LF = LU.getNewFixup(); in CollectLoopInvariantFixupsAndFormulae()
3559 LU.AllFixupsOutsideLoop &= LF.isUseFullyOutsideLoop(L); in CollectLoopInvariantFixupsAndFormulae()
3560 if (!LU.WidestFixupType || in CollectLoopInvariantFixupsAndFormulae()
3561 SE.getTypeSizeInBits(LU.WidestFixupType) < in CollectLoopInvariantFixupsAndFormulae()
3563 LU.WidestFixupType = LF.OperandValToReplace->getType(); in CollectLoopInvariantFixupsAndFormulae()
3564 InsertSupplementalFormula(US, LU, LUIdx); in CollectLoopInvariantFixupsAndFormulae()
3565 CountRegisters(LU.Formulae.back(), Uses.size() - 1); in CollectLoopInvariantFixupsAndFormulae()
3636 LSRUse &LU, const SCEV *S, const Loop *L, in mayUsePostIncMode() argument
3638 if (LU.Kind != LSRUse::Address || in mayUsePostIncMode()
3639 !LU.AccessTy.getType()->isIntOrIntVectorTy()) in mayUsePostIncMode()
3658 void LSRInstance::GenerateReassociationsImpl(LSRUse &LU, unsigned LUIdx, in GenerateReassociationsImpl() argument
3667 if (AMK == TTI::AMK_PostIndexed && mayUsePostIncMode(TTI, LU, BaseReg, L, SE)) in GenerateReassociationsImpl()
3687 if (isAlwaysFoldable(TTI, SE, LU.MinOffset, LU.MaxOffset, LU.Kind, in GenerateReassociationsImpl()
3688 LU.AccessTy, *J, Base.getNumRegs() > 1)) in GenerateReassociationsImpl()
3700 isAlwaysFoldable(TTI, SE, LU.MinOffset, LU.MaxOffset, LU.Kind, in GenerateReassociationsImpl()
3701 LU.AccessTy, InnerAddOps[0], Base.getNumRegs() > 1)) in GenerateReassociationsImpl()
3738 if (InsertFormula(LU, LUIdx, F)) in GenerateReassociationsImpl()
3745 GenerateReassociations(LU, LUIdx, LU.Formulae.back(), in GenerateReassociationsImpl()
3751 void LSRInstance::GenerateReassociations(LSRUse &LU, unsigned LUIdx, in GenerateReassociations() argument
3759 GenerateReassociationsImpl(LU, LUIdx, Base, Depth, i); in GenerateReassociations()
3762 GenerateReassociationsImpl(LU, LUIdx, Base, Depth, in GenerateReassociations()
3768 void LSRInstance::GenerateCombinations(LSRUse &LU, unsigned LUIdx, in GenerateCombinations() argument
3810 (void)InsertFormula(LU, LUIdx, F); in GenerateCombinations()
3831 void LSRInstance::GenerateSymbolicOffsetsImpl(LSRUse &LU, unsigned LUIdx, in GenerateSymbolicOffsetsImpl() argument
3840 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateSymbolicOffsetsImpl()
3846 (void)InsertFormula(LU, LUIdx, F); in GenerateSymbolicOffsetsImpl()
3850 void LSRInstance::GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, in GenerateSymbolicOffsets() argument
3856 GenerateSymbolicOffsetsImpl(LU, LUIdx, Base, i); in GenerateSymbolicOffsets()
3858 GenerateSymbolicOffsetsImpl(LU, LUIdx, Base, /* Idx */ -1, in GenerateSymbolicOffsets()
3864 LSRUse &LU, unsigned LUIdx, const Formula &Base, in GenerateConstantOffsetsImpl() argument
3871 if (isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) { in GenerateConstantOffsetsImpl()
3887 (void)InsertFormula(LU, LUIdx, F); in GenerateConstantOffsetsImpl()
3901 if (AMK == TTI::AMK_PreIndexed && LU.Kind == LSRUse::Address) { in GenerateConstantOffsetsImpl()
3924 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateConstantOffsetsImpl()
3934 (void)InsertFormula(LU, LUIdx, F); in GenerateConstantOffsetsImpl()
3938 void LSRInstance::GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, in GenerateConstantOffsets() argument
3943 Worklist.push_back(LU.MinOffset); in GenerateConstantOffsets()
3944 if (LU.MaxOffset != LU.MinOffset) in GenerateConstantOffsets()
3945 Worklist.push_back(LU.MaxOffset); in GenerateConstantOffsets()
3948 GenerateConstantOffsetsImpl(LU, LUIdx, Base, Worklist, i); in GenerateConstantOffsets()
3950 GenerateConstantOffsetsImpl(LU, LUIdx, Base, Worklist, /* Idx */ -1, in GenerateConstantOffsets()
3956 void LSRInstance::GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, in GenerateICmpZeroScales() argument
3958 if (LU.Kind != LSRUse::ICmpZero) return; in GenerateICmpZeroScales()
3966 if (LU.MinOffset != LU.MaxOffset) return; in GenerateICmpZeroScales()
3994 int64_t Offset = LU.MinOffset; in GenerateICmpZeroScales()
3998 if (Offset / Factor != LU.MinOffset) in GenerateICmpZeroScales()
4009 if (!isLegalUse(TTI, Offset, Offset, LU.Kind, LU.AccessTy, F)) in GenerateICmpZeroScales()
4013 F.BaseOffset = (uint64_t)F.BaseOffset + Offset - LU.MinOffset; in GenerateICmpZeroScales()
4046 (void)InsertFormula(LU, LUIdx, F); in GenerateICmpZeroScales()
4053 void LSRInstance::GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) { in GenerateScales() argument
4070 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateScales()
4074 if (LU.Kind == LSRUse::Basic && in GenerateScales()
4075 isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LSRUse::Special, in GenerateScales()
4076 LU.AccessTy, Base) && in GenerateScales()
4077 LU.AllFixupsOutsideLoop) in GenerateScales()
4078 LU.Kind = LSRUse::Special; in GenerateScales()
4084 if (LU.Kind == LSRUse::ICmpZero && in GenerateScales()
4090 if (AR && (AR->getLoop() == L || LU.AllFixupsOutsideLoop)) { in GenerateScales()
4106 (AR->getLoop() != L && LU.AllFixupsOutsideLoop))) in GenerateScales()
4110 if (F.Scale == 1 && LU.AllFixupsOutsideLoop) in GenerateScales()
4112 (void)InsertFormula(LU, LUIdx, F); in GenerateScales()
4120 void LSRInstance::GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) { in GenerateTruncates() argument
4170 (void)InsertFormula(LU, LUIdx, F); in GenerateTruncates()
4292 LSRUse &LU = Uses[LUIdx]; in GenerateCrossUseConstantOffsets() local
4301 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) { in GenerateCrossUseConstantOffsets()
4302 Formula F = LU.Formulae[L]; in GenerateCrossUseConstantOffsets()
4317 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateCrossUseConstantOffsets()
4333 (void)InsertFormula(LU, LUIdx, NewF); in GenerateCrossUseConstantOffsets()
4342 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, in GenerateCrossUseConstantOffsets()
4343 LU.Kind, LU.AccessTy, NewF)) { in GenerateCrossUseConstantOffsets()
4345 mayUsePostIncMode(TTI, LU, OrigReg, this->L, SE)) in GenerateCrossUseConstantOffsets()
4368 (void)InsertFormula(LU, LUIdx, NewF); in GenerateCrossUseConstantOffsets()
4383 LSRUse &LU = Uses[LUIdx]; in GenerateAllReuseFormulae() local
4384 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4385 GenerateReassociations(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4386 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4387 GenerateCombinations(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4390 LSRUse &LU = Uses[LUIdx]; in GenerateAllReuseFormulae() local
4391 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4392 GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4393 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4394 GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4395 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4396 GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4397 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4398 GenerateScales(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4401 LSRUse &LU = Uses[LUIdx]; in GenerateAllReuseFormulae() local
4402 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
4403 GenerateTruncates(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
4431 LSRUse &LU = Uses[LUIdx]; in FilterOutUndesirableDedicatedRegisters() local
4432 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs()); in FilterOutUndesirableDedicatedRegisters()
4436 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); in FilterOutUndesirableDedicatedRegisters()
4438 Formula &F = LU.Formulae[FIdx]; in FilterOutUndesirableDedicatedRegisters()
4449 CostF.RateFormula(F, Regs, VisitedRegs, LU, &LoserRegs); in FilterOutUndesirableDedicatedRegisters()
4478 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters()
4482 CostBest.RateFormula(Best, Regs, VisitedRegs, LU); in FilterOutUndesirableDedicatedRegisters()
4493 LU.DeleteFormula(F); in FilterOutUndesirableDedicatedRegisters()
4501 LU.RecomputeRegs(LUIdx, RegUses); in FilterOutUndesirableDedicatedRegisters()
4519 for (const LSRUse &LU : Uses) { in EstimateSearchSpaceComplexity() local
4520 size_t FSize = LU.Formulae.size(); in EstimateSearchSpaceComplexity()
4544 LSRUse &LU = Uses[LUIdx]; in NarrowSearchSpaceByDetectingSupersets() local
4546 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { in NarrowSearchSpaceByDetectingSupersets()
4547 Formula &F = LU.Formulae[i]; in NarrowSearchSpaceByDetectingSupersets()
4560 if (LU.HasFormulaWithSameRegs(NewF)) { in NarrowSearchSpaceByDetectingSupersets()
4563 LU.DeleteFormula(F); in NarrowSearchSpaceByDetectingSupersets()
4576 if (LU.HasFormulaWithSameRegs(NewF)) { in NarrowSearchSpaceByDetectingSupersets()
4579 LU.DeleteFormula(F); in NarrowSearchSpaceByDetectingSupersets()
4590 LU.RecomputeRegs(LUIdx, RegUses); in NarrowSearchSpaceByDetectingSupersets()
4611 LSRUse &LU = Uses[LUIdx]; in NarrowSearchSpaceByCollapsingUnrolledCode() local
4612 for (const Formula &F : LU.Formulae) { in NarrowSearchSpaceByCollapsingUnrolledCode()
4616 LSRUse *LUThatHas = FindUseWithSimilarFormula(F, LU); in NarrowSearchSpaceByCollapsingUnrolledCode()
4621 LU.Kind, LU.AccessTy)) in NarrowSearchSpaceByCollapsingUnrolledCode()
4624 LLVM_DEBUG(dbgs() << " Deleting use "; LU.print(dbgs()); dbgs() << '\n'); in NarrowSearchSpaceByCollapsingUnrolledCode()
4626 LUThatHas->AllFixupsOutsideLoop &= LU.AllFixupsOutsideLoop; in NarrowSearchSpaceByCollapsingUnrolledCode()
4629 for (LSRFixup &Fixup : LU.Fixups) { in NarrowSearchSpaceByCollapsingUnrolledCode()
4653 DeleteUse(LU, LUIdx); in NarrowSearchSpaceByCollapsingUnrolledCode()
4708 LSRUse &LU = Uses[LUIdx]; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg() local
4709 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs()); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4736 CostFA.RateFormula(FA, Regs, VisitedRegs, LU); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4738 CostFB.RateFormula(FB, Regs, VisitedRegs, LU); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4743 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4745 Formula &F = LU.Formulae[FIdx]; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4752 Formula &Best = LU.Formulae[P.first->second]; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4762 LU.DeleteFormula(F); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4768 LU.RecomputeRegs(LUIdx, RegUses); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4794 LSRUse &LU = Uses[LUIdx]; in NarrowSearchSpaceByFilterPostInc() local
4796 if (LU.Kind != LSRUse::Address) in NarrowSearchSpaceByFilterPostInc()
4798 if (!TTI.isIndexedLoadLegal(TTI.MIM_PostInc, LU.AccessTy.getType()) && in NarrowSearchSpaceByFilterPostInc()
4799 !TTI.isIndexedStoreLegal(TTI.MIM_PostInc, LU.AccessTy.getType())) in NarrowSearchSpaceByFilterPostInc()
4803 for (const Formula &F : LU.Formulae) in NarrowSearchSpaceByFilterPostInc()
4807 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms; in NarrowSearchSpaceByFilterPostInc()
4809 Formula &F = LU.Formulae[FIdx]; in NarrowSearchSpaceByFilterPostInc()
4813 LU.DeleteFormula(F); in NarrowSearchSpaceByFilterPostInc()
4820 LU.RecomputeRegs(LUIdx, RegUses); in NarrowSearchSpaceByFilterPostInc()
4889 for (const LSRUse &LU : Uses) { in NarrowSearchSpaceByDeletingCostlyFormulas() local
4890 if (!LU.Regs.count(Reg)) in NarrowSearchSpaceByDeletingCostlyFormulas()
4892 float P = LU.getNotSelectedProbability(Reg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4906 LSRUse &LU = Uses[LUIdx]; in NarrowSearchSpaceByDeletingCostlyFormulas() local
4908 if (LU.Formulae.size() < 2) in NarrowSearchSpaceByDeletingCostlyFormulas()
4913 float FMinRegNum = LU.Formulae[0].getNumRegs(); in NarrowSearchSpaceByDeletingCostlyFormulas()
4914 float FMinARegNum = LU.Formulae[0].getNumRegs(); in NarrowSearchSpaceByDeletingCostlyFormulas()
4916 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4917 Formula &F = LU.Formulae[i]; in NarrowSearchSpaceByDeletingCostlyFormulas()
4923 FRegNum += RegNumMap[BaseReg] / LU.getNotSelectedProbability(BaseReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4926 RegNumMap[BaseReg] / LU.getNotSelectedProbability(BaseReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4931 RegNumMap[ScaledReg] / LU.getNotSelectedProbability(ScaledReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4934 RegNumMap[ScaledReg] / LU.getNotSelectedProbability(ScaledReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4944 LLVM_DEBUG(dbgs() << " The formula "; LU.Formulae[MinIdx].print(dbgs()); in NarrowSearchSpaceByDeletingCostlyFormulas()
4947 std::swap(LU.Formulae[MinIdx], LU.Formulae[0]); in NarrowSearchSpaceByDeletingCostlyFormulas()
4948 while (LU.Formulae.size() != 1) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4949 LLVM_DEBUG(dbgs() << " Deleting "; LU.Formulae.back().print(dbgs()); in NarrowSearchSpaceByDeletingCostlyFormulas()
4951 LU.Formulae.pop_back(); in NarrowSearchSpaceByDeletingCostlyFormulas()
4953 LU.RecomputeRegs(LUIdx, RegUses); in NarrowSearchSpaceByDeletingCostlyFormulas()
4954 assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula"); in NarrowSearchSpaceByDeletingCostlyFormulas()
4955 Formula &F = LU.Formulae[0]; in NarrowSearchSpaceByDeletingCostlyFormulas()
5004 LSRUse &LU = Uses[LUIdx]; in NarrowSearchSpaceByPickingWinnerRegs() local
5005 if (!LU.Regs.count(Best)) continue; in NarrowSearchSpaceByPickingWinnerRegs()
5008 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { in NarrowSearchSpaceByPickingWinnerRegs()
5009 Formula &F = LU.Formulae[i]; in NarrowSearchSpaceByPickingWinnerRegs()
5012 LU.DeleteFormula(F); in NarrowSearchSpaceByPickingWinnerRegs()
5022 LU.RecomputeRegs(LUIdx, RegUses); in NarrowSearchSpaceByPickingWinnerRegs()
5063 const LSRUse &LU = Uses[Workspace.size()]; in SolveRecurse() local
5071 if (LU.Regs.count(S)) in SolveRecurse()
5076 for (const Formula &F : LU.Formulae) { in SolveRecurse()
5083 if (AMK != TTI::AMK_PostIndexed || LU.Kind != LSRUse::Address) { in SolveRecurse()
5104 NewCost.RateFormula(F, NewRegs, VisitedRegs, LU); in SolveRecurse()
5223 BasicBlock::iterator LowestIP, const LSRFixup &LF, const LSRUse &LU) const { in AdjustInsertPositionForExpand()
5230 if (LU.Kind == LSRUse::ICmpZero) in AdjustInsertPositionForExpand()
5284 Value *LSRInstance::Expand(const LSRUse &LU, const LSRFixup &LF, in Expand() argument
5287 if (LU.RigidFormula) in Expand()
5292 IP = AdjustInsertPositionForExpand(IP, LF, LU); in Expand()
5333 if (LU.Kind == LSRUse::ICmpZero) { in Expand()
5352 if (!Ops.empty() && LU.Kind == LSRUse::Address && in Expand()
5353 isAMCompletelyFolded(TTI, LU, F)) { in Expand()
5388 if (LU.Kind == LSRUse::ICmpZero) { in Expand()
5424 if (LU.Kind == LSRUse::ICmpZero) { in Expand()
5463 PHINode *PN, const LSRUse &LU, const LSRFixup &LF, const Formula &F, in RewriteForPHI() argument
5520 Expand(LU, LF, F, BB->getTerminator()->getIterator(), DeadInsts); in RewriteForPHI()
5578 void LSRInstance::Rewrite(const LSRUse &LU, const LSRFixup &LF, in Rewrite() argument
5584 RewriteForPHI(PN, LU, LF, F, DeadInsts); in Rewrite()
5586 Value *FullV = Expand(LU, LF, F, LF.UserInst->getIterator(), DeadInsts); in Rewrite()
5602 if (LU.Kind == LSRUse::ICmpZero) in Rewrite()
5798 for (const LSRUse &LU : Uses) { in LSRInstance() local
5799 for (const Formula &F : LU.Formulae) in LSRInstance()
5800 assert(isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in LSRInstance()
5832 for (const LSRUse &LU : Uses) in print_fixups() local
5833 for (const LSRFixup &LF : LU.Fixups) { in print_fixups()
5842 for (const LSRUse &LU : Uses) { in print_uses() local
5844 LU.print(OS); in print_uses()
5846 for (const Formula &F : LU.Formulae) { in print_uses()