1359   SmallVector<Formula, 12> Formulae;  member in __anonc21373340811::LSRUse
1712   for (const Formula &F : Formulae)  in getNotSelectedProbability()
1715   return ((float)(Formulae.size() - FNum)) / Formulae.size();  in getNotSelectedProbability()
1723   if (!Formulae.empty() && RigidFormula)  in InsertFormula()
1743   Formulae.push_back(F);  in InsertFormula()
1755   if (&F != &Formulae.back())  in DeleteFormula()
1756     std::swap(F, Formulae.back());  in DeleteFormula()
1757   Formulae.pop_back();  in DeleteFormula()
1765   for (const Formula &F : Formulae) {  in RecomputeRegs()
2871       for (const Formula &F : LU.Formulae) {  in FindUseWithSimilarFormula()
3642     if (LU.Formulae.empty()) {  in CollectFixupsAndInitialFormulae()
3644       CountRegisters(LU.Formulae.back(), LUIdx);  in CollectFixupsAndInitialFormulae()
3822         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
4007       GenerateReassociations(LU, LUIdx, LU.Formulae.back(),  in GenerateReassociationsImpl()
4615     for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {  in GenerateCrossUseConstantOffsets()
4616       Formula F = LU.Formulae[L];  in GenerateCrossUseConstantOffsets()
4717     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4718       GenerateReassociations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4719     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4720       GenerateCombinations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4724     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4725       GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4726     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4727       GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4728     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4729       GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4730     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4731       GenerateScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4735     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4736       GenerateTruncates(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4769     for (size_t FIdx = 0, NumForms = LU.Formulae.size();  in FilterOutUndesirableDedicatedRegisters()
4771       Formula &F = LU.Formulae[FIdx];  in FilterOutUndesirableDedicatedRegisters()
4811         Formula &Best = LU.Formulae[P.first->second];  in FilterOutUndesirableDedicatedRegisters()
4853     size_t FSize = LU.Formulae.size();  in EstimateSearchSpaceComplexity()
4879       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDetectingSupersets()
4880         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDetectingSupersets()
4949     for (const Formula &F : LU.Formulae) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4974       for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4975         Formula &F = LUThatHas->Formulae[i];  in NarrowSearchSpaceByCollapsingUnrolledCode()
5080     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5082       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5089       Formula &Best = LU.Formulae[P.first->second];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5140     for (const Formula &F : LU.Formulae)  in NarrowSearchSpaceByFilterPostInc()
5144     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterPostInc()
5146       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterPostInc()
5245     if (LU.Formulae.size() < 2)  in NarrowSearchSpaceByDeletingCostlyFormulas()
5250     float FMinRegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
5251     float FMinARegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
5253     for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
5254       Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDeletingCostlyFormulas()
5281     LLVM_DEBUG(dbgs() << "  The formula "; LU.Formulae[MinIdx].print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
5284       std::swap(LU.Formulae[MinIdx], LU.Formulae[0]);  in NarrowSearchSpaceByDeletingCostlyFormulas()
5285     while (LU.Formulae.size() != 1) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
5286       LLVM_DEBUG(dbgs() << "  Deleting "; LU.Formulae.back().print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
5288       LU.Formulae.pop_back();  in NarrowSearchSpaceByDeletingCostlyFormulas()
5291     assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");  in NarrowSearchSpaceByDeletingCostlyFormulas()
5292     Formula &F = LU.Formulae[0];  in NarrowSearchSpaceByDeletingCostlyFormulas()
5384       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByPickingWinnerRegs()
5385         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByPickingWinnerRegs()
5452   for (const Formula &F : LU.Formulae) {  in SolveRecurse()
6257     for (const Formula &F : LU.Formulae)  in LSRInstance()
6304     for (const Formula &F : LU.Formulae) {  in print_uses()