1207   SmallVector<Formula, 12> Formulae;  member in __anon90f29ee80711::LSRUse
1553   for (const Formula &F : Formulae)  in getNotSelectedProbability()
1556   return ((float)(Formulae.size() - FNum)) / Formulae.size();  in getNotSelectedProbability()
1564   if (!Formulae.empty() && RigidFormula)  in InsertFormula()
1584   Formulae.push_back(F);  in InsertFormula()
1596   if (&F != &Formulae.back())  in DeleteFormula()
1597     std::swap(F, Formulae.back());  in DeleteFormula()
1598   Formulae.pop_back();  in DeleteFormula()
1606   for (const Formula &F : Formulae) {  in RecomputeRegs()
2665       for (const Formula &F : LU.Formulae) {  in FindUseWithSimilarFormula()
3374     if (LU.Formulae.empty()) {  in CollectFixupsAndInitialFormulae()
3376       CountRegisters(LU.Formulae.back(), LUIdx);  in CollectFixupsAndInitialFormulae()
3524         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
3704       GenerateReassociations(LU, LUIdx, LU.Formulae.back(),  in GenerateReassociationsImpl()
4248     for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {  in GenerateCrossUseConstantOffsets()
4249       Formula F = LU.Formulae[L];  in GenerateCrossUseConstantOffsets()
4331     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4332       GenerateReassociations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4333     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4334       GenerateCombinations(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4338     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4339       GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4340     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4341       GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4342     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4343       GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4344     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4345       GenerateScales(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4349     for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)  in GenerateAllReuseFormulae()
4350       GenerateTruncates(LU, LUIdx, LU.Formulae[i]);  in GenerateAllReuseFormulae()
4383     for (size_t FIdx = 0, NumForms = LU.Formulae.size();  in FilterOutUndesirableDedicatedRegisters()
4385       Formula &F = LU.Formulae[FIdx];  in FilterOutUndesirableDedicatedRegisters()
4425         Formula &Best = LU.Formulae[P.first->second];  in FilterOutUndesirableDedicatedRegisters()
4467     size_t FSize = LU.Formulae.size();  in EstimateSearchSpaceComplexity()
4493       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDetectingSupersets()
4494         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDetectingSupersets()
4559     for (const Formula &F : LU.Formulae) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4584       for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4585         Formula &F = LUThatHas->Formulae[i];  in NarrowSearchSpaceByCollapsingUnrolledCode()
4690     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4692       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4699       Formula &Best = LU.Formulae[P.first->second];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4750     for (const Formula &F : LU.Formulae)  in NarrowSearchSpaceByFilterPostInc()
4754     for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;  in NarrowSearchSpaceByFilterPostInc()
4756       Formula &F = LU.Formulae[FIdx];  in NarrowSearchSpaceByFilterPostInc()
4855     if (LU.Formulae.size() < 2)  in NarrowSearchSpaceByDeletingCostlyFormulas()
4860     float FMinRegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4861     float FMinARegNum = LU.Formulae[0].getNumRegs();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4863     for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4864       Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByDeletingCostlyFormulas()
4891     LLVM_DEBUG(dbgs() << "  The formula "; LU.Formulae[MinIdx].print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
4894       std::swap(LU.Formulae[MinIdx], LU.Formulae[0]);  in NarrowSearchSpaceByDeletingCostlyFormulas()
4895     while (LU.Formulae.size() != 1) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4896       LLVM_DEBUG(dbgs() << "  Deleting "; LU.Formulae.back().print(dbgs());  in NarrowSearchSpaceByDeletingCostlyFormulas()
4898       LU.Formulae.pop_back();  in NarrowSearchSpaceByDeletingCostlyFormulas()
4901     assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");  in NarrowSearchSpaceByDeletingCostlyFormulas()
4902     Formula &F = LU.Formulae[0];  in NarrowSearchSpaceByDeletingCostlyFormulas()
4955       for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {  in NarrowSearchSpaceByPickingWinnerRegs()
4956         Formula &F = LU.Formulae[i];  in NarrowSearchSpaceByPickingWinnerRegs()
5023   for (const Formula &F : LU.Formulae) {  in SolveRecurse()
5765     for (const Formula &F : LU.Formulae)  in LSRInstance()
5812     for (const Formula &F : LU.Formulae) {  in print_uses()