Lines Matching refs:Formulae
35 // TODO: More sophistication in the way Formulae are generated and filtered.
1168 SmallVector<Formula, 12> Formulae;
1516 for (const Formula &F : Formulae)
1519 return ((float)(Formulae.size() - FNum)) / Formulae.size();
1527 if (!Formulae.empty() && RigidFormula)
1547 Formulae.push_back(F);
1559 if (&F != &Formulae.back())
1560 std::swap(F, Formulae.back());
1561 Formulae.pop_back();
1569 for (const Formula &F : Formulae) {
2621 for (const Formula &F : LU.Formulae) {
3328 if (LU.Formulae.empty()) {
3330 CountRegisters(LU.Formulae.back(), LUIdx);
3475 CountRegisters(LU.Formulae.back(), Uses.size() - 1);
3655 GenerateReassociations(LU, LUIdx, LU.Formulae.back(),
4194 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {
4195 Formula F = LU.Formulae[L];
4277 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4278 GenerateReassociations(LU, LUIdx, LU.Formulae[i]);
4279 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4280 GenerateCombinations(LU, LUIdx, LU.Formulae[i]);
4284 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4285 GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]);
4286 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4287 GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]);
4288 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4289 GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]);
4290 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4291 GenerateScales(LU, LUIdx, LU.Formulae[i]);
4295 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4296 GenerateTruncates(LU, LUIdx, LU.Formulae[i]);
4329 for (size_t FIdx = 0, NumForms = LU.Formulae.size();
4331 Formula &F = LU.Formulae[FIdx];
4371 Formula &Best = LU.Formulae[P.first->second];
4413 size_t FSize = LU.Formulae.size();
4439 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
4440 Formula &F = LU.Formulae[i];
4505 for (const Formula &F : LU.Formulae) {
4530 for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {
4531 Formula &F = LUThatHas->Formulae[i];
4588 "from the Formulae with the same Scale and ScaledReg.\n");
4636 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;
4638 Formula &F = LU.Formulae[FIdx];
4645 Formula &Best = LU.Formulae[P.first->second];
4696 for (const Formula &F : LU.Formulae)
4700 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;
4702 Formula &F = LU.Formulae[FIdx];
4801 if (LU.Formulae.size() < 2)
4806 float FMinRegNum = LU.Formulae[0].getNumRegs();
4807 float FMinARegNum = LU.Formulae[0].getNumRegs();
4809 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
4810 Formula &F = LU.Formulae[i];
4837 LLVM_DEBUG(dbgs() << " The formula "; LU.Formulae[MinIdx].print(dbgs());
4840 std::swap(LU.Formulae[MinIdx], LU.Formulae[0]);
4841 while (LU.Formulae.size() != 1) {
4842 LLVM_DEBUG(dbgs() << " Deleting "; LU.Formulae.back().print(dbgs());
4844 LU.Formulae.pop_back();
4847 assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");
4848 Formula &F = LU.Formulae[0];
4901 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
4902 Formula &F = LU.Formulae[i];
4969 for (const Formula &F : LU.Formulae) {
5653 // Formulae should be legal.
5655 for (const Formula &F : LU.Formulae)
5702 for (const Formula &F : LU.Formulae) {