Lines Matching refs:Formulae
1249 SmallVector<Formula, 12> Formulae; member in __anonb19727160711::LSRUse
1288 if (!Formulae.empty() && RigidFormula) in InsertFormula()
1309 Formulae.push_back(F); in InsertFormula()
1321 if (&F != &Formulae.back()) in DeleteFormula()
1322 std::swap(F, Formulae.back()); in DeleteFormula()
1323 Formulae.pop_back(); in DeleteFormula()
1331 for (const Formula &F : Formulae) { in RecomputeRegs()
2352 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(), in FindUseWithSimilarFormula()
2353 E = LU.Formulae.end(); I != E; ++I) { in FindUseWithSimilarFormula()
3049 if (LU.Formulae.empty()) { in CollectFixupsAndInitialFormulae()
3051 CountRegisters(LU.Formulae.back(), LF.LUIdx); in CollectFixupsAndInitialFormulae()
3190 CountRegisters(LU.Formulae.back(), Uses.size() - 1); in CollectLoopInvariantFixupsAndFormulae()
3338 GenerateReassociations(LU, LUIdx, LU.Formulae.back(), Depth + 1); in GenerateReassociationsImpl()
3799 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) { in GenerateCrossUseConstantOffsets()
3800 Formula F = LU.Formulae[L]; in GenerateCrossUseConstantOffsets()
3882 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3883 GenerateReassociations(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3884 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3885 GenerateCombinations(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3889 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3890 GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3891 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3892 GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3893 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3894 GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3895 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3896 GenerateScales(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3900 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) in GenerateAllReuseFormulae()
3901 GenerateTruncates(LU, LUIdx, LU.Formulae[i]); in GenerateAllReuseFormulae()
3932 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); in FilterOutUndesirableDedicatedRegisters()
3934 Formula &F = LU.Formulae[FIdx]; in FilterOutUndesirableDedicatedRegisters()
3977 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters()
4025 size_t FSize = I->Formulae.size(); in EstimateSearchSpaceComplexity()
4052 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { in NarrowSearchSpaceByDetectingSupersets()
4053 Formula &F = LU.Formulae[i]; in NarrowSearchSpaceByDetectingSupersets()
4116 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(), in NarrowSearchSpaceByCollapsingUnrolledCode()
4117 E = LU.Formulae.end(); I != E; ++I) { in NarrowSearchSpaceByCollapsingUnrolledCode()
4157 for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) { in NarrowSearchSpaceByCollapsingUnrolledCode()
4158 Formula &F = LUThatHas->Formulae[i]; in NarrowSearchSpaceByCollapsingUnrolledCode()
4245 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { in NarrowSearchSpaceByPickingWinnerRegs()
4246 Formula &F = LU.Formulae[i]; in NarrowSearchSpaceByPickingWinnerRegs()
4308 for (SmallVectorImpl<Formula>::const_iterator I = LU.Formulae.begin(), in SolveRecurse()
4309 E = LU.Formulae.end(); I != E; ++I) { in SolveRecurse()
4955 for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(), in LSRInstance()
4956 JE = LU.Formulae.end(); in LSRInstance()
5007 for (SmallVectorImpl<Formula>::const_iterator J = LU.Formulae.begin(), in print_uses()
5008 JE = LU.Formulae.end(); J != JE; ++J) { in print_uses()