reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1525 for (const Formula &F : Formulae) 1528 return ((float)(Formulae.size() - FNum)) / Formulae.size(); 1528 return ((float)(Formulae.size() - FNum)) / Formulae.size(); 1536 if (!Formulae.empty() && RigidFormula) 1556 Formulae.push_back(F); 1568 if (&F != &Formulae.back()) 1569 std::swap(F, Formulae.back()); 1570 Formulae.pop_back(); 1578 for (const Formula &F : Formulae) { 2628 for (const Formula &F : LU.Formulae) { 3326 if (LU.Formulae.empty()) { 3328 CountRegisters(LU.Formulae.back(), LUIdx); 3473 CountRegisters(LU.Formulae.back(), Uses.size() - 1); 3656 GenerateReassociations(LU, LUIdx, LU.Formulae.back(), 4195 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) { 4196 Formula F = LU.Formulae[L]; 4278 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4279 GenerateReassociations(LU, LUIdx, LU.Formulae[i]); 4280 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4281 GenerateCombinations(LU, LUIdx, LU.Formulae[i]); 4285 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4286 GenerateSymbolicOffsets(LU, LUIdx, LU.Formulae[i]); 4287 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4288 GenerateConstantOffsets(LU, LUIdx, LU.Formulae[i]); 4289 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4290 GenerateICmpZeroScales(LU, LUIdx, LU.Formulae[i]); 4291 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4292 GenerateScales(LU, LUIdx, LU.Formulae[i]); 4296 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i) 4297 GenerateTruncates(LU, LUIdx, LU.Formulae[i]); 4330 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); 4332 Formula &F = LU.Formulae[FIdx]; 4372 Formula &Best = LU.Formulae[P.first->second]; 4414 size_t FSize = LU.Formulae.size(); 4440 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { 4441 Formula &F = LU.Formulae[i]; 4506 for (const Formula &F : LU.Formulae) { 4531 for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) { 4532 Formula &F = LUThatHas->Formulae[i]; 4637 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms; 4639 Formula &F = LU.Formulae[FIdx]; 4646 Formula &Best = LU.Formulae[P.first->second]; 4754 if (LU.Formulae.size() < 2) 4759 float FMinRegNum = LU.Formulae[0].getNumRegs(); 4760 float FMinARegNum = LU.Formulae[0].getNumRegs(); 4762 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { 4763 Formula &F = LU.Formulae[i]; 4790 LLVM_DEBUG(dbgs() << " The formula "; LU.Formulae[MinIdx].print(dbgs()); 4793 std::swap(LU.Formulae[MinIdx], LU.Formulae[0]); 4793 std::swap(LU.Formulae[MinIdx], LU.Formulae[0]); 4794 while (LU.Formulae.size() != 1) { 4795 LLVM_DEBUG(dbgs() << " Deleting "; LU.Formulae.back().print(dbgs()); 4797 LU.Formulae.pop_back(); 4800 assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula"); 4801 Formula &F = LU.Formulae[0]; 4854 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) { 4855 Formula &F = LU.Formulae[i]; 4921 for (const Formula &F : LU.Formulae) { 5599 for (const Formula &F : LU.Formulae) 5646 for (const Formula &F : LU.Formulae) {