1223   SmallVector<Formula, 12> Formulae;  member in __anon926e14ea0811::LSRUse
1571   for (const Formula &F : Formulae)  in getNotSelectedProbability()
1574   return ((float)(Formulae.size() - FNum)) / Formulae.size();  in getNotSelectedProbability()
1582   if (!Formulae.empty() && RigidFormula)  in InsertFormula()
1602   Formulae.push_back(F);  in InsertFormula()
1614   if (&F != &Formulae.back())  in DeleteFormula()
1615     std::swap(F, Formulae.back());  in DeleteFormula()
1616   Formulae.pop_back();  in DeleteFormula()
1624   for (const Formula &F : Formulae) {  in RecomputeRegs()
2675       for (const Formula &F : LU.Formulae) {  in FindUseWithSimilarFormula()
3407     if (LU.Formulae.empty()) {  in CollectFixupsAndInitialFormulae()
3409       CountRegisters(LU.Formulae.back(), LUIdx);  in CollectFixupsAndInitialFormulae()
3587         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
3767       GenerateReassociations(LU, LUIdx, LU.Formulae.back(),  in GenerateReassociationsImpl()
4351     for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {  in GenerateCrossUseConstantOffsets()
4352       Formula F = LU.Formulae[L];  in GenerateCrossUseConstantOffsets()
4434     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4435       GenerateReassociations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4436     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4437       GenerateCombinations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4441     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4442       GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4443     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4444       GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4445     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4446       GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4447     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4448       GenerateScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4452     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4453       GenerateTruncates(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4486     for (size_t FIdx = 0, NumForms = LU.Formulae.size();  in FilterOutUndesirableDedicatedRegisters()
4488       Formula &F = LU.Formulae[FIdx];  in FilterOutUndesirableDedicatedRegisters()
4528         Formula &Best = LU.Formulae[P.first->second];  in FilterOutUndesirableDedicatedRegisters()
4570     size_t FSize = LU.Formulae.size();  in EstimateSearchSpaceComplexity()
4596       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDetectingSupersets()
4597         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDetectingSupersets()
4662     for (const Formula &F : LU.Formulae) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4687       for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4688         Formula &F = LUThatHas->Formulae[i];  in NarrowSearchSpaceByCollapsingUnrolledCode()
4793     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4795       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4802       Formula &Best = LU.Formulae[P.first->second];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4853     for (const Formula &F : LU.Formulae)  in NarrowSearchSpaceByFilterPostInc()
4857     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterPostInc()
4859       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterPostInc()
4958     if (LU.Formulae.size() < 2)  in NarrowSearchSpaceByDeletingCostlyFormulas()
4963     float FMinRegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4964     float FMinARegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4966     for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4967       Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDeletingCostlyFormulas()
4994     LLVM_DEBUG(dbgs() << "  The formula "; LU.Formulae[MinIdx].print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
4997       std::swap(LU.Formulae[MinIdx], LU.Formulae[0]);  in NarrowSearchSpaceByDeletingCostlyFormulas()
4998     while (LU.Formulae.size() != 1) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4999       LLVM_DEBUG(dbgs() << "  Deleting "; LU.Formulae.back().print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
5001       LU.Formulae.pop_back();  in NarrowSearchSpaceByDeletingCostlyFormulas()
5004     assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");  in NarrowSearchSpaceByDeletingCostlyFormulas()
5005     Formula &F = LU.Formulae[0];  in NarrowSearchSpaceByDeletingCostlyFormulas()
5097       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByPickingWinnerRegs()
5098         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByPickingWinnerRegs()
5165   for (const Formula &F : LU.Formulae) {  in SolveRecurse()
5955     for (const Formula &F : LU.Formulae)  in LSRInstance()
6002     for (const Formula &F : LU.Formulae) {  in print_uses()