Lines Matching defs:Cost
15 /// About Cost Model numbers used below it's necessary to say the following:
80 unsigned Cost = ~0U;
83 Cost = RecipThroughputCost;
86 Cost = LatencyCost;
89 Cost = CodeSizeCost;
92 Cost = SizeAndLatencyCost;
95 if (Cost == ~0U)
97 return Cost;
329 InstructionCost Cost =
333 Cost += getArithmeticInstrCost(Instruction::Sub, Ty, CostKind);
334 return Cost;
343 InstructionCost Cost =
346 Cost += getArithmeticInstrCost(Instruction::LShr, Ty, CostKind,
348 Cost += getArithmeticInstrCost(Instruction::Add, Ty, CostKind,
353 Cost += getArithmeticInstrCost(Instruction::Mul, Ty, CostKind, Op1Info.getNoProps(),
355 Cost += getArithmeticInstrCost(Instruction::Sub, Ty, CostKind, Op1Info.getNoProps(),
359 return Cost;
388 if (auto KindCost = Entry->Cost[CostKind])
413 if (auto KindCost = Entry->Cost[CostKind])
449 if (auto KindCost = Entry->Cost[CostKind])
490 if (auto KindCost = Entry->Cost[CostKind])
533 if (auto KindCost = Entry->Cost[CostKind])
564 if (auto KindCost = Entry->Cost[CostKind])
582 if (auto KindCost = Entry->Cost[CostKind])
605 if (auto KindCost = Entry->Cost[CostKind])
627 if (auto KindCost = Entry->Cost[CostKind])
649 if (auto KindCost = Entry->Cost[CostKind])
660 if (auto KindCost = Entry->Cost[CostKind])
682 if (auto KindCost = Entry->Cost[CostKind])
704 if (auto KindCost = Entry->Cost[CostKind])
728 if (auto KindCost = Entry->Cost[CostKind])
765 if (auto KindCost = Entry->Cost[CostKind])
803 if (auto KindCost = Entry->Cost[CostKind])
829 if (auto KindCost = Entry->Cost[CostKind])
841 if (auto KindCost = Entry->Cost[CostKind])
890 if (auto KindCost = Entry->Cost[CostKind])
984 if (auto KindCost = Entry->Cost[CostKind])
1020 if (auto KindCost = Entry->Cost[CostKind])
1062 if (auto KindCost = Entry->Cost[CostKind])
1084 if (auto KindCost = Entry->Cost[CostKind])
1113 if (auto KindCost = Entry->Cost[CostKind])
1188 if (auto KindCost = Entry->Cost[CostKind])
1289 if (auto KindCost = Entry->Cost[CostKind])
1318 if (auto KindCost = Entry->Cost[CostKind])
1341 if (auto KindCost = Entry->Cost[CostKind])
1350 if (auto KindCost = Entry->Cost[CostKind])
1420 if (auto KindCost = Entry->Cost[CostKind])
1442 if (auto KindCost = Entry->Cost[CostKind])
1453 if (auto KindCost = Entry->Cost[CostKind])
1477 if (auto KindCost = Entry->Cost[CostKind])
1709 if (auto KindCost = Entry->Cost[CostKind])
1760 InstructionCost Cost = 0;
1764 &Cost](ArrayRef<int> RegMask, unsigned SrcReg, unsigned DestReg) {
1770 Cost += getShuffleCost(TTI::SK_PermuteSingleSrc, SingleOpTy,
1774 Cost += TTI::TCC_Basic;
1780 Cost += TTI::TCC_Free;
1786 &Cost](ArrayRef<int> RegMask, unsigned /*Unused*/,
1788 Cost += getShuffleCost(TTI::SK_PermuteTwoSrc, SingleOpTy, RegMask,
1791 return Cost;
1820 if (auto KindCost = Entry->Cost[CostKind])
1856 if (auto KindCost = Entry->Cost[CostKind])
1935 if (auto KindCost = Entry->Cost[CostKind])
1955 if (auto KindCost = Entry->Cost[CostKind])
2004 if (auto KindCost = Entry->Cost[CostKind])
2028 if (auto KindCost = Entry->Cost[CostKind])
2059 if (auto KindCost = Entry->Cost[CostKind])
2123 if (auto KindCost = Entry->Cost[CostKind])
2138 if (auto KindCost = Entry->Cost[CostKind])
2171 if (auto KindCost = Entry->Cost[CostKind])
2235 return LT.first * Entry->Cost;
2239 if (auto KindCost = Entry->Cost[CostKind])
2262 if (auto KindCost = Entry->Cost[CostKind])
3103 if (auto KindCost = Entry->Cost[CostKind])
3109 if (auto KindCost = Entry->Cost[CostKind])
3115 if (auto KindCost = Entry->Cost[CostKind])
3122 if (auto KindCost = Entry->Cost[CostKind])
3128 if (auto KindCost = Entry->Cost[CostKind])
3134 if (auto KindCost = Entry->Cost[CostKind])
3140 if (auto KindCost = Entry->Cost[CostKind])
3147 if (auto KindCost = Entry->Cost[CostKind])
3154 if (auto KindCost = Entry->Cost[CostKind])
3161 if (auto KindCost = Entry->Cost[CostKind])
3168 if (auto KindCost = Entry->Cost[CostKind])
3192 if (auto KindCost = Entry->Cost[CostKind])
3198 if (auto KindCost = Entry->Cost[CostKind])
3204 if (auto KindCost = Entry->Cost[CostKind])
3211 if (auto KindCost = Entry->Cost[CostKind])
3217 if (auto KindCost = Entry->Cost[CostKind])
3223 if (auto KindCost = Entry->Cost[CostKind])
3229 if (auto KindCost = Entry->Cost[CostKind])
3235 if (auto KindCost = Entry->Cost[CostKind])
3241 if (auto KindCost = Entry->Cost[CostKind])
3248 if (auto KindCost = Entry->Cost[CostKind])
3254 if (auto KindCost = Entry->Cost[CostKind])
3285 auto AdjustCost = [&CostKind](InstructionCost Cost,
3288 return Cost == 0 ? 0 : N;
3289 return Cost * N;
3537 if (auto KindCost = Entry->Cost[CostKind])
3542 if (auto KindCost = Entry->Cost[CostKind])
3547 if (auto KindCost = Entry->Cost[CostKind])
3552 if (auto KindCost = Entry->Cost[CostKind])
3557 if (auto KindCost = Entry->Cost[CostKind])
3562 if (auto KindCost = Entry->Cost[CostKind])
3567 if (auto KindCost = Entry->Cost[CostKind])
3572 if (auto KindCost = Entry->Cost[CostKind])
3577 if (auto KindCost = Entry->Cost[CostKind])
3582 if (auto KindCost = Entry->Cost[CostKind])
4570 auto adjustTableCost = [&](int ISD, unsigned Cost,
4598 return LegalizationCost * (int)Cost;
4621 if (auto KindCost = Entry->Cost[CostKind])
4626 if (auto KindCost = Entry->Cost[CostKind])
4631 if (auto KindCost = Entry->Cost[CostKind])
4636 if (auto KindCost = Entry->Cost[CostKind])
4641 if (auto KindCost = Entry->Cost[CostKind])
4646 if (auto KindCost = Entry->Cost[CostKind])
4651 if (auto KindCost = Entry->Cost[CostKind])
4656 if (auto KindCost = Entry->Cost[CostKind])
4661 if (auto KindCost = Entry->Cost[CostKind])
4666 if (auto KindCost = Entry->Cost[CostKind])
4671 if (auto KindCost = Entry->Cost[CostKind])
4676 if (auto KindCost = Entry->Cost[CostKind])
4681 if (auto KindCost = Entry->Cost[CostKind])
4686 if (auto KindCost = Entry->Cost[CostKind])
4691 if (auto KindCost = Entry->Cost[CostKind])
4696 if (auto KindCost = Entry->Cost[CostKind])
4701 if (auto KindCost = Entry->Cost[CostKind])
4707 if (auto KindCost = Entry->Cost[CostKind])
4711 if (auto KindCost = Entry->Cost[CostKind])
4718 if (auto KindCost = Entry->Cost[CostKind])
4722 if (auto KindCost = Entry->Cost[CostKind])
4729 if (auto KindCost = Entry->Cost[CostKind])
4733 if (auto KindCost = Entry->Cost[CostKind])
4739 if (auto KindCost = Entry->Cost[CostKind])
4743 if (auto KindCost = Entry->Cost[CostKind])
4751 InstructionCost Cost = 0;
4752 Cost += getArithmeticInstrCost(BinaryOperator::Or, RetTy, CostKind);
4753 Cost += getArithmeticInstrCost(BinaryOperator::Sub, RetTy, CostKind);
4754 Cost += getArithmeticInstrCost(BinaryOperator::Shl, RetTy, CostKind);
4755 Cost += getArithmeticInstrCost(BinaryOperator::LShr, RetTy, CostKind);
4756 Cost += getArithmeticInstrCost(BinaryOperator::And, RetTy, CostKind);
4757 Cost += getCmpSelInstrCost(BinaryOperator::ICmp, RetTy, CondTy,
4759 Cost += getCmpSelInstrCost(BinaryOperator::Select, RetTy, CondTy,
4761 return Cost;
4888 return Entry->Cost + RegisterFileMoveCost;
4927 InstructionCost Cost = 0;
4946 Cost += BaseT::getScalarizationOverhead(Ty, DemandedElts, Insert,
4984 Cost += getShuffleCost(TTI::SK_ExtractSubvector, Ty, {}, CostKind,
4986 Cost += BaseT::getScalarizationOverhead(LaneTy, LaneEltMask, Insert,
5002 Cost += getShuffleCost(TTI::SK_InsertSubvector, Ty, {}, CostKind,
5013 Cost += DemandedElts.popcount();
5021 Cost += (std::min<unsigned>(NumElts, Pow2Elts) - 1) * LT.first;
5062 Cost += getShuffleCost(TTI::SK_ExtractSubvector, Ty, {}, CostKind,
5064 Cost += BaseT::getScalarizationOverhead(
5068 return Cost;
5073 Cost += BaseT::getScalarizationOverhead(Ty, DemandedElts, /*Insert*/ false,
5077 return Cost;
5217 InstructionCost Cost = 0;
5221 Cost += getMemoryOpCost(Instruction::Load, Src, DL.getABITypeAlign(Src),
5228 return (LT.second.isFloatingPoint() ? Cost : 0) + LT.first * 1;
5306 Cost += 2;
5308 Cost += 2;
5310 Cost += 1;
5315 return Cost;
5324 Cost += getShuffleCost(IsLoad ? TTI::ShuffleKind::SK_InsertSubvector
5341 Cost += getScalarizationOverhead(CoalescedVecTy, DemandedElts, IsLoad,
5353 return Cost;
5393 InstructionCost Cost = 0;
5397 return Cost + LT.first;
5402 Cost +=
5411 Cost += getShuffleCost(TTI::SK_InsertSubvector, NewMaskTy, {}, CostKind, 0,
5417 return Cost + LT.first * (IsLoad ? 2 : 8);
5420 return Cost + LT.first;
5452 // Cost modeling of Strided Access Computation is hidden by the indexing
5524 return Entry->Cost;
5528 return Entry->Cost;
5532 return Entry->Cost;
5563 return ArithmeticCost + Entry->Cost;
5567 return ArithmeticCost + Entry->Cost;
5571 return ArithmeticCost + Entry->Cost;
5633 return ArithmeticCost + Entry->Cost;
5636 return ArithmeticCost + Entry->Cost;
5639 return ArithmeticCost + Entry->Cost;
5642 return ArithmeticCost + Entry->Cost;
5796 return Entry->Cost;
5800 return Entry->Cost;
5804 return Entry->Cost;
5808 return Entry->Cost;
5828 return MinMaxCost + Entry->Cost;
5832 return MinMaxCost + Entry->Cost;
5836 return MinMaxCost + Entry->Cost;
5840 return MinMaxCost + Entry->Cost;
5938 InstructionCost Cost = 0;
5942 Cost += getIntImmCost(Val);
5945 return std::max<InstructionCost>(1, Cost);
6044 InstructionCost Cost = X86TTIImpl::getIntImmCost(Imm, Ty, CostKind);
6045 return (Cost <= NumConstants * TTI::TCC_Basic)
6047 : Cost;
6633 return MaskCost + NumOfMemOps * MemOpCost + Entry->Cost;
6669 InstructionCost Cost = NumOfResults * NumOfShufflesPerResult * ShuffleCost +
6673 return Cost;
6693 return MaskCost + NumOfMemOps * MemOpCost + Entry->Cost;
6706 InstructionCost Cost =
6710 return Cost;
6780 // The Cost accounts only for the shuffle sequence;
6990 return MemOpCosts + divideCeil(NumMembers * Entry->Cost, Factor);
7015 return MemOpCosts + Entry->Cost;
7020 return MemOpCosts + Entry->Cost;