Home
last modified time | relevance | path

Searched refs:NewCost (Results 1 – 7 of 7) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVectorCombine.cpp282 InstructionCost NewCost = in vectorizeLoadInsert() local
297 NewCost += TTI.getShuffleCost(TTI::SK_PermuteSingleSrc, Ty, MinVecTy, Mask, in vectorizeLoadInsert()
302 if (OldCost < NewCost || !NewCost.isValid()) in vectorizeLoadInsert()
360 InstructionCost NewCost = in widenSubvectorLoad() local
365 if (OldCost < NewCost || !NewCost.isValid()) in widenSubvectorLoad()
482 InstructionCost OldCost, NewCost; in isExtractExtractCheap() local
491 NewCost = VectorOpCost + CheapExtractCost + HasUseTax * CheapExtractCost; in isExtractExtractCheap()
496 NewCost = VectorOpCost + CheapExtractCost + in isExtractExtractCheap()
517 NewCost += TTI.getShuffleCost(TargetTransformInfo::SK_PermuteSingleSrc, in isExtractExtractCheap()
521 NewCost += TTI.getShuffleCost(TargetTransformInfo::SK_PermuteSingleSrc, in isExtractExtractCheap()
[all …]
H A DSLPVectorizer.cpp9752 InstructionCost NewCost = in canBuildSplitNode() local
9759 if (NewCost >= OriginalCost) in canBuildSplitNode()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCodeGenPrepare.cpp1603 InstructionCost NewCost = in tryNarrowMathIfNoOverflow() local
1611 NewCost += NumOfNonConstOps * TTI.getCastInstrCost(Instruction::Trunc, in tryNarrowMathIfNoOverflow()
1616 NewCost += in tryNarrowMathIfNoOverflow()
1619 if (NewCost >= OldCost) in tryNarrowMathIfNoOverflow()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp5427 Cost NewCost(L, SE, TTI, AMK); in SolveRecurse() local
5454 NewCost = CurCost; in SolveRecurse()
5456 NewCost.RateFormula(F, NewRegs, VisitedRegs, LU, HardwareLoopProfitable); in SolveRecurse()
5457 if (NewCost.isLess(SolutionCost)) { in SolveRecurse()
5460 SolveRecurse(Solution, SolutionCost, Workspace, NewCost, in SolveRecurse()
5465 LLVM_DEBUG(dbgs() << "New best at "; NewCost.print(dbgs()); in SolveRecurse()
5471 SolutionCost = NewCost; in SolveRecurse()
H A DLowerMatrixIntrinsics.cpp1574 InstructionCost NewCost = TTI.getArithmeticInstrCost( in lowerDotProduct() local
1576 return NewCost - OriginalCost; in lowerDotProduct()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp3881 bool isPromotionProfitable(unsigned NewCost, unsigned OldCost,
5120 unsigned NewCost, unsigned OldCost, Value *PromotedOperand) const { in isPromotionProfitable() argument
5121 LLVM_DEBUG(dbgs() << "OldCost: " << OldCost << "\tNewCost: " << NewCost in isPromotionProfitable()
5126 if (NewCost > OldCost) in isPromotionProfitable()
5128 if (NewCost < OldCost) in isPromotionProfitable()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelDAGToDAG.cpp582 unsigned NewCost = ConstantMaterializationCost(NewMulConstVal, Subtarget); in canExtractShiftFromMul() local
583 return NewCost < OldCost; in canExtractShiftFromMul()