1210   SmallVector<Formula, 12> Formulae;  member in __anon3f0d62640811::LSRUse
1558   for (const Formula &F : Formulae)  in getNotSelectedProbability()
1561   return ((float)(Formulae.size() - FNum)) / Formulae.size();  in getNotSelectedProbability()
1569   if (!Formulae.empty() && RigidFormula)  in InsertFormula()
1589   Formulae.push_back(F);  in InsertFormula()
1601   if (&F != &Formulae.back())  in DeleteFormula()
1602     std::swap(F, Formulae.back());  in DeleteFormula()
1603   Formulae.pop_back();  in DeleteFormula()
1611   for (const Formula &F : Formulae) {  in RecomputeRegs()
2668       for (const Formula &F : LU.Formulae) {  in FindUseWithSimilarFormula()
3390     if (LU.Formulae.empty()) {  in CollectFixupsAndInitialFormulae()
3392       CountRegisters(LU.Formulae.back(), LUIdx);  in CollectFixupsAndInitialFormulae()
3565         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
3745       GenerateReassociations(LU, LUIdx, LU.Formulae.back(),  in GenerateReassociationsImpl()
4301     for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {  in GenerateCrossUseConstantOffsets()
4302       Formula F = LU.Formulae[L];  in GenerateCrossUseConstantOffsets()
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()
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()
4402     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4403       GenerateTruncates(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4436     for (size_t FIdx = 0, NumForms = LU.Formulae.size();  in FilterOutUndesirableDedicatedRegisters()
4438       Formula &F = LU.Formulae[FIdx];  in FilterOutUndesirableDedicatedRegisters()
4478         Formula &Best = LU.Formulae[P.first->second];  in FilterOutUndesirableDedicatedRegisters()
4520     size_t FSize = LU.Formulae.size();  in EstimateSearchSpaceComplexity()
4546       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDetectingSupersets()
4547         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDetectingSupersets()
4612     for (const Formula &F : LU.Formulae) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4637       for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4638         Formula &F = LUThatHas->Formulae[i];  in NarrowSearchSpaceByCollapsingUnrolledCode()
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()
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()
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()
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()
4954     assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");  in NarrowSearchSpaceByDeletingCostlyFormulas()
4955     Formula &F = LU.Formulae[0];  in NarrowSearchSpaceByDeletingCostlyFormulas()
5008       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByPickingWinnerRegs()
5009         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByPickingWinnerRegs()
5076   for (const Formula &F : LU.Formulae) {  in SolveRecurse()
5799     for (const Formula &F : LU.Formulae)  in LSRInstance()
5846     for (const Formula &F : LU.Formulae) {  in print_uses()