1173   SmallVector<Formula, 12> Formulae;  member in __anon244971d90711::LSRUse
1502   for (const Formula &F : Formulae)  in getNotSelectedProbability()
1505   return ((float)(Formulae.size() - FNum)) / Formulae.size();  in getNotSelectedProbability()
1513   if (!Formulae.empty() && RigidFormula)  in InsertFormula()
1533   Formulae.push_back(F);  in InsertFormula()
1545   if (&F != &Formulae.back())  in DeleteFormula()
1546     std::swap(F, Formulae.back());  in DeleteFormula()
1547   Formulae.pop_back();  in DeleteFormula()
1555   for (const Formula &F : Formulae) {  in RecomputeRegs()
2601       for (const Formula &F : LU.Formulae) {  in FindUseWithSimilarFormula()
3290     if (LU.Formulae.empty()) {  in CollectFixupsAndInitialFormulae()
3292       CountRegisters(LU.Formulae.back(), LUIdx);  in CollectFixupsAndInitialFormulae()
3437         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
3620       GenerateReassociations(LU, LUIdx, LU.Formulae.back(),  in GenerateReassociationsImpl()
4106     for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {  in GenerateCrossUseConstantOffsets()
4107       Formula F = LU.Formulae[L];  in GenerateCrossUseConstantOffsets()
4189     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4190       GenerateReassociations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4191     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4192       GenerateCombinations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4196     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4197       GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4198     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4199       GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4200     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4201       GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4202     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4203       GenerateScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4207     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4208       GenerateTruncates(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4241     for (size_t FIdx = 0, NumForms = LU.Formulae.size();  in FilterOutUndesirableDedicatedRegisters()
4243       Formula &F = LU.Formulae[FIdx];  in FilterOutUndesirableDedicatedRegisters()
4283         Formula &Best = LU.Formulae[P.first->second];  in FilterOutUndesirableDedicatedRegisters()
4325     size_t FSize = LU.Formulae.size();  in EstimateSearchSpaceComplexity()
4351       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDetectingSupersets()
4352         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDetectingSupersets()
4415     for (const Formula &F : LU.Formulae) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4440       for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4441         Formula &F = LUThatHas->Formulae[i];  in NarrowSearchSpaceByCollapsingUnrolledCode()
4545     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4547       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4554       Formula &Best = LU.Formulae[P.first->second];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4662     if (LU.Formulae.size() < 2)  in NarrowSearchSpaceByDeletingCostlyFormulas()
4667     float FMinRegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4668     float FMinARegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4670     for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4671       Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDeletingCostlyFormulas()
4698     LLVM_DEBUG(dbgs() << "  The formula "; LU.Formulae[MinIdx].print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
4701       std::swap(LU.Formulae[MinIdx], LU.Formulae[0]);  in NarrowSearchSpaceByDeletingCostlyFormulas()
4702     while (LU.Formulae.size() != 1) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4703       LLVM_DEBUG(dbgs() << "  Deleting "; LU.Formulae.back().print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
4705       LU.Formulae.pop_back();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4708     assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");  in NarrowSearchSpaceByDeletingCostlyFormulas()
4709     Formula &F = LU.Formulae[0];  in NarrowSearchSpaceByDeletingCostlyFormulas()
4761       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByPickingWinnerRegs()
4762         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByPickingWinnerRegs()
4828   for (const Formula &F : LU.Formulae) {  in SolveRecurse()
5462     for (const Formula &F : LU.Formulae)  in LSRInstance()
5509     for (const Formula &F : LU.Formulae) {  in print_uses()