HomeSort by: relevance | last modified time | path
    Searched refs:NewCost (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VectorCombine.cpp 198 InstructionCost NewCost =
212 NewCost += TTI.getShuffleCost(TTI::SK_PermuteSingleSrc, MinVecTy, Mask);
216 if (OldCost < NewCost || !NewCost.isValid())
329 InstructionCost OldCost, NewCost;
338 NewCost = VectorOpCost + CheapExtractCost + HasUseTax * CheapExtractCost;
343 NewCost = VectorOpCost + CheapExtractCost +
360 NewCost +=
367 return OldCost < NewCost;
636 InstructionCost NewCost = ScalarOpCost + InsertCost
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 4986 Cost NewCost(L, SE, TTI, AMK);
5013 NewCost = CurCost;
5015 NewCost.RateFormula(F, NewRegs, VisitedRegs, LU);
5016 if (NewCost.isLess(SolutionCost)) {
5019 SolveRecurse(Solution, SolutionCost, Workspace, NewCost,
5024 LLVM_DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
5030 SolutionCost = NewCost;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
CodeGenPrepare.cpp 3195 bool isPromotionProfitable(unsigned NewCost, unsigned OldCost,
4436 /// \p NewCost gives the cost of extension instructions created by the
4444 unsigned NewCost, unsigned OldCost, Value *PromotedOperand) const {
4445 LLVM_DEBUG(dbgs() << "OldCost: " << OldCost << "\tNewCost: " << NewCost
4450 if (NewCost > OldCost)
4452 if (NewCost < OldCost)
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMISelDAGToDAG.cpp 568 unsigned NewCost = ConstantMaterializationCost(NewMulConstVal, Subtarget);
569 return NewCost < OldCost;

Completed in 32 milliseconds