Searched refs:NewCost (Results 1 – 3 of 3) sorted by relevance
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 4243 Cost NewCost; in SolveRecurse() local
4266 NewCost = CurCost; in SolveRecurse()
4268 NewCost.RateFormula(TTI, F, NewRegs, VisitedRegs, L, LU.Offsets, SE, DT, in SolveRecurse()
4270 if (NewCost < SolutionCost) { in SolveRecurse()
4273 SolveRecurse(Solution, SolutionCost, Workspace, NewCost, in SolveRecurse()
4278 DEBUG(dbgs() << "New best at "; NewCost.print(dbgs()); in SolveRecurse()
4284 SolutionCost = NewCost; in SolveRecurse()
|
| /external/llvm/lib/CodeGen/ |
| D | CodeGenPrepare.cpp | 2599 bool isPromotionProfitable(unsigned NewCost, unsigned OldCost,
3060 unsigned NewCost, unsigned OldCost, Value *PromotedOperand) const { in isPromotionProfitable() argument
3061 DEBUG(dbgs() << "OldCost: " << OldCost << "\tNewCost: " << NewCost << '\n'); in isPromotionProfitable()
3065 if (NewCost > OldCost) in isPromotionProfitable()
3067 if (NewCost < OldCost) in isPromotionProfitable()
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMISelDAGToDAG.cpp | 529 unsigned NewCost = ConstantMaterializationCost(NewMulConstVal); in canExtractShiftFromMul() local
530 return NewCost < OldCost; in canExtractShiftFromMul()
|