Lines Matching defs:Cost

869       int Cost = 0;
886 Cost += UserInDiffLaneCost;
893 Cost += UserInDiffLaneCost;
896 Cost += ExternalUseCost;
904 return Cost;
3250 int Cost = TTI->getShuffleCost(ShuffleKind.getValue(), VecTy);
3260 Cost -= TTI->getVectorInstrCost(Instruction::ExtractElement, VecTy,
3264 return ReuseShuffleCost + Cost;
3473 // Cost of wide load - cost of scalar loads.
3677 int Cost = 0;
3731 Cost += NumCalls * TTI->getCostOfKeepingLiveOverCall(V);
3737 return Cost;
3741 int Cost = 0;
3775 Cost += C;
3810 Cost += SpillCost + ExtractCost;
3815 OS << "SLP: Spill Cost = " << SpillCost << ".\n"
3816 << "SLP: Extract Cost = " << ExtractCost << ".\n"
3817 << "SLP: Total Cost = " << Cost << ".\n";
3824 return Cost;
3829 int Cost = 0;
3832 Cost += TTI->getVectorInstrCost(Instruction::InsertElement, Ty, i);
3834 Cost += TTI->getShuffleCost(TargetTransformInfo::SK_PermuteSingleSrc, Ty);
3835 return Cost;
5709 int Cost = R.getTreeCost();
5711 LLVM_DEBUG(dbgs() << "SLP: Found cost=" << Cost << " for VF=" << VF << "\n");
5712 if (Cost < -SLPCostThreshold) {
5713 LLVM_DEBUG(dbgs() << "SLP: Decided to vectorize cost=" << Cost << "\n");
5719 << "Stores SLP vectorized with cost " << NV("Cost", Cost)
5958 int Cost = R.getTreeCost() - UserCost;
5960 MinCost = std::min(MinCost, Cost);
5962 if (Cost < -SLPCostThreshold) {
5963 LLVM_DEBUG(dbgs() << "SLP: Vectorizing list at cost:" << Cost << ".\n");
5966 << "SLP vectorized with cost " << ore::NV("Cost", Cost)
5983 << ore::NV("Cost", MinCost) << " >= "
6758 int Cost = TreeCost + ReductionCost;
6759 if (Cost >= -SLPCostThreshold) {
6765 << ore::NV("Cost", Cost) << " and threshold "
6772 << Cost << ". (HorRdx)\n");
6777 << ore::NV("Cost", Cost) << " and with tree size "