Home
last modified time | relevance | path

Searched refs:Cost (Results 1 – 25 of 71) sorted by relevance

123

/external/llvm/lib/Analysis/
DTargetTransformInfo.cpp51 int Cost = TTIImpl->getOperationCost(Opcode, Ty, OpTy); in getOperationCost() local
52 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getOperationCost()
53 return Cost; in getOperationCost()
57 int Cost = TTIImpl->getCallCost(FTy, NumArgs); in getCallCost() local
58 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getCallCost()
59 return Cost; in getCallCost()
64 int Cost = TTIImpl->getCallCost(F, Arguments); in getCallCost() local
65 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getCallCost()
66 return Cost; in getCallCost()
71 int Cost = TTIImpl->getIntrinsicCost(IID, RetTy, Arguments); in getIntrinsicCost() local
[all …]
DInlineCost.cpp63 int Cost; member in __anon265bc4620111::CallAnalyzer
167 Cost(0), IsCallerRecursive(false), IsRecursiveCall(false), in CallAnalyzer()
180 int getCost() { return Cost; } in getCost()
226 Cost += CostIt->second; in disableSROA()
804 Cost += CS.arg_size() * InlineConstants::InstrCost; in visitCallSite()
809 Cost += InlineConstants::CallPenalty; in visitCallSite()
821 Cost += CS.arg_size() * InlineConstants::InstrCost; in visitCallSite()
838 Cost -= std::max(0, CA.getThreshold() - CA.getCost()); in visitCallSite()
885 Cost += (SuccessorBlocks.size() - 1) * InlineConstants::InstrCost; in visitSwitchInst()
987 Cost += InlineConstants::CallPenalty; in analyzeBlock()
[all …]
/external/llvm/test/Analysis/CostModel/X86/
Dalternate-shuffle-cost.ll18 ; CHECK: Printing analysis 'Cost Model Analysis' for function 'test_v2i32':
19 ; SSE2: Cost Model: {{.*}} 1 for instruction: %1 = shufflevector
20 ; SSSE3: Cost Model: {{.*}} 1 for instruction: %1 = shufflevector
21 ; SSE41: Cost Model: {{.*}} 1 for instruction: %1 = shufflevector
22 ; AVX: Cost Model: {{.*}} 1 for instruction: %1 = shufflevector
23 ; AVX2: Cost Model: {{.*}} 1 for instruction: %1 = shufflevector
29 ; CHECK: Printing analysis 'Cost Model Analysis' for function 'test_v2f32':
30 ; SSE2: Cost Model: {{.*}} 2 for instruction: %1 = shufflevector
31 ; SSSE3: Cost Model: {{.*}} 2 for instruction: %1 = shufflevector
32 ; SSE41: Cost Model: {{.*}} 1 for instruction: %1 = shufflevector
[all …]
Dvselect-cost.ll13 ; CHECK: Printing analysis 'Cost Model Analysis' for function 'test_2i64':
14 ; SSE2: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
15 ; SSE41: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
16 ; AVX: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
17 ; AVX2: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
23 ; CHECK: Printing analysis 'Cost Model Analysis' for function 'test_2double':
24 ; SSE2: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
25 ; SSE41: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
26 ; AVX: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
27 ; AVX2: Cost Model: {{.*}} 1 for instruction: %sel = select <2 x i1>
[all …]
Dintrinsic-cost.ll24 ; CORE2: Printing analysis 'Cost Model Analysis' for function 'test1':
25 ; CORE2: Cost Model: Found an estimated cost of 46 for instruction: %2 = call <4 x float> @llvm.c…
27 ; COREI7: Printing analysis 'Cost Model Analysis' for function 'test1':
28 ; COREI7: Cost Model: Found an estimated cost of 1 for instruction: %2 = call <4 x float> @llvm.c…
52 ; CORE2: Printing analysis 'Cost Model Analysis' for function 'test2':
53 ; CORE2: Cost Model: Found an estimated cost of 46 for instruction: %2 = call <4 x float> @llvm.n…
55 ; COREI7: Printing analysis 'Cost Model Analysis' for function 'test2':
56 ; COREI7: Cost Model: Found an estimated cost of 1 for instruction: %2 = call <4 x float> @llvm.n…
80 ; CORE2: Printing analysis 'Cost Model Analysis' for function 'test3':
81 ; CORE2: Cost Model: Found an estimated cost of 4 for instruction: %2 = call <4 x float> @llvm.fmul…
[all …]
Dvdiv-cost.ll8 ; CHECK: 'Cost Model Analysis' for function 'test1':
17 ; CHECK: 'Cost Model Analysis' for function 'test2':
26 ; CHECK: 'Cost Model Analysis' for function 'test3':
35 ; CHECK: 'Cost Model Analysis' for function 'test4':
44 ; CHECK: 'Cost Model Analysis' for function 'test5':
53 ; CHECK: 'Cost Model Analysis' for function 'test6':
62 ; CHECK: 'Cost Model Analysis' for function 'test7':
71 ; CHECK: 'Cost Model Analysis' for function 'test8':
80 ; CHECK: 'Cost Model Analysis' for function 'test9':
89 ; CHECK: 'Cost Model Analysis' for function 'test10':
Dvshift-ashr-cost.ll15 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v2i64':
26 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v4i64':
37 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v4i32':
49 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v8i32':
61 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v8i16':
72 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v16i16':
83 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v16i8':
94 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v32i8':
109 ; CHECK: 'Cost Model Analysis' for function 'splatvar_shift_v2i64':
121 ; CHECK: 'Cost Model Analysis' for function 'splatvar_shift_v4i64':
[all …]
Dvshift-lshr-cost.ll15 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v2i64':
27 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v4i64':
39 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v4i32':
51 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v8i32':
63 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v8i16':
74 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v16i16':
85 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v16i8':
96 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v32i8':
111 ; CHECK: 'Cost Model Analysis' for function 'splatvar_shift_v2i64':
124 ; CHECK: 'Cost Model Analysis' for function 'splatvar_shift_v4i64':
[all …]
Dvshift-shl-cost.ll16 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v2i64':
28 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v4i64':
40 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v4i32':
52 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v8i32':
64 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v8i16':
75 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v16i16':
86 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v16i8':
97 ; CHECK: 'Cost Model Analysis' for function 'var_shift_v32i8':
112 ; CHECK: 'Cost Model Analysis' for function 'splatvar_shift_v2i64':
125 ; CHECK: 'Cost Model Analysis' for function 'splatvar_shift_v4i64':
[all …]
/external/llvm/utils/PerfectShuffle/
DPerfectShuffle.cpp89 unsigned Cost; // Number of instrs used to generate this value. member
92 ShuffleVal() : Cost(1000000) {} in ShuffleVal()
108 unsigned Cost; member
112 : Name(name), ShuffleMask(shufflemask), OpNum(opnum),Cost(cost) { in Operator()
125 unsigned getCost() const { return Cost; } in getCost()
164 if (ShufTab[ShufTab[ThisOp].Arg0].Cost == 0) { in PrintOperation()
178 if (ShufTab[ShufTab[ThisOp].Arg1].Cost == 0) { in PrintOperation()
196 Count += ShufTab[i].Cost < 100; in getNumEntered()
202 if (ShufTab[Elt].Cost == 0) return; in EvaluateOps()
210 if (ShufTab[Arg0].Cost) in EvaluateOps()
[all …]
/external/llvm/include/llvm/Analysis/
DInlineCost.h58 const int Cost; variable
64 InlineCost(int Cost, int Threshold) : Cost(Cost), Threshold(Threshold) {} in InlineCost() argument
67 static InlineCost get(int Cost, int Threshold) { in get() argument
68 assert(Cost > AlwaysInlineCost && "Cost crosses sentinel value"); in get()
69 assert(Cost < NeverInlineCost && "Cost crosses sentinel value"); in get()
70 return InlineCost(Cost, Threshold); in get()
81 return Cost < Threshold;
84 bool isAlways() const { return Cost == AlwaysInlineCost; } in isAlways()
85 bool isNever() const { return Cost == NeverInlineCost; } in isNever()
92 return Cost; in getCost()
/external/eigen/Eigen/src/Core/
DFunctors.h37 Cost = NumTraits<Scalar>::AddCost,
65 Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost)/2, // rough estimate!
94 Cost = NumTraits<LhsScalar>::MulCost,
117 Cost = NumTraits<Scalar>::AddCost,
140 Cost = NumTraits<Scalar>::AddCost,
166 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess=0 };
178 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false };
198 Cost = NumTraits<Scalar>::AddCost,
223 Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost), // rough estimate!
241 Cost = NumTraits<bool>::AddCost,
[all …]
DVisitor.h81 && (SizeAtCompileTime == 1 || internal::functor_traits<Visitor>::Cost != Dynamic)
82 …SizeAtCompileTime * CoeffReadCost + (SizeAtCompileTime-1) * internal::functor_traits<Visitor>::Cost
133 Cost = NumTraits<Scalar>::AddCost
161 Cost = NumTraits<Scalar>::AddCost
/external/llvm/utils/TableGen/
DDAGISelEmitter.cpp45 unsigned Cost = 0; in getResultPatternCost() local
48 Cost++; in getResultPatternCost()
51 Cost += 10; in getResultPatternCost()
54 Cost += getResultPatternCost(P->getChild(i), CGP); in getResultPatternCost()
55 return Cost; in getResultPatternCost()
64 unsigned Cost = 0; in getResultPatternSize() local
67 Cost += Op->getValueAsInt("CodeSize"); in getResultPatternSize()
70 Cost += getResultPatternSize(P->getChild(i), CGP); in getResultPatternSize()
71 return Cost; in getResultPatternSize()
/external/llvm/lib/Target/X86/
DX86TargetTransformInfo.cpp105 int Cost = 2 * getArithmeticInstrCost(Instruction::AShr, Ty, Op1Info, in getArithmeticInstrCost() local
108 Cost += getArithmeticInstrCost(Instruction::LShr, Ty, Op1Info, Op2Info, in getArithmeticInstrCost()
111 Cost += getArithmeticInstrCost(Instruction::Add, Ty, Op1Info, Op2Info, in getArithmeticInstrCost()
115 return Cost; in getArithmeticInstrCost()
131 return LT.first * Entry->Cost; in getArithmeticInstrCost()
145 return LT.first * Entry->Cost; in getArithmeticInstrCost()
173 return LT.first * Entry->Cost; in getArithmeticInstrCost()
208 return LT.first * Entry->Cost; in getArithmeticInstrCost()
238 return LT.first * Entry->Cost; in getArithmeticInstrCost()
287 return LT.first * Entry->Cost; in getArithmeticInstrCost()
[all …]
/external/llvm/include/llvm/CodeGen/
DBasicTTIImpl.h49 unsigned Cost = 0; in getScalarizationOverhead() local
53 Cost += static_cast<T *>(this) in getScalarizationOverhead()
56 Cost += static_cast<T *>(this) in getScalarizationOverhead()
60 return Cost; in getScalarizationOverhead()
66 unsigned Cost = 0; in getAltShuffleOverhead() local
75 Cost += static_cast<T *>(this) in getAltShuffleOverhead()
77 Cost += static_cast<T *>(this) in getAltShuffleOverhead()
80 return Cost; in getAltShuffleOverhead()
318 unsigned Cost = static_cast<T *>(this) variable
323 return getScalarizationOverhead(Ty, true, true) + Num * Cost;
[all …]
/external/llvm/lib/CodeGen/
DRegisterClassInfo.cpp103 unsigned Cost = TRI->getCostPerUse(PhysReg); in compute() local
104 MinCost = std::min(MinCost, Cost); in compute()
110 if (Cost != LastCost) in compute()
113 LastCost = Cost; in compute()
122 unsigned Cost = TRI->getCostPerUse(PhysReg); in compute() local
123 if (Cost != LastCost) in compute()
126 LastCost = Cost; in compute()
DRegAllocGreedy.cpp643 unsigned Cost = TRI->getCostPerUse(PhysReg); in tryAssign() local
646 if (!Cost) in tryAssign()
649 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost in tryAssign()
651 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); in tryAssign()
742 EvictionCost Cost; in canEvictInterference() local
774 Cost.BrokenHints += 10; in canEvictInterference()
779 Cost.BrokenHints += BreaksHint; in canEvictInterference()
780 Cost.MaxWeight = std::max(Cost.MaxWeight, Intf->weight); in canEvictInterference()
782 if (!(Cost < MaxCost)) in canEvictInterference()
798 MaxCost = Cost; in canEvictInterference()
[all …]
DMachineLICM.cpp186 bool CanCauseHighRegPressure(const DenseMap<unsigned, int> &Cost,
788 auto Cost = calcRegisterCost(MI, /*ConsiderSeen=*/true, ConsiderUnseenAsDef); in UpdateRegPressure() local
789 for (const auto &RPIdAndCost : Cost) { in UpdateRegPressure()
807 DenseMap<unsigned, int> Cost; in calcRegisterCost() local
809 return Cost; in calcRegisterCost()
838 if (Cost.find(*PS) == Cost.end()) in calcRegisterCost()
839 Cost[*PS] = RCCost; in calcRegisterCost()
841 Cost[*PS] += RCCost; in calcRegisterCost()
844 return Cost; in calcRegisterCost()
1031 bool MachineLICM::CanCauseHighRegPressure(const DenseMap<unsigned, int>& Cost, in CanCauseHighRegPressure() argument
[all …]
/external/llvm/lib/Target/AArch64/
DAArch64TargetTransformInfo.cpp54 int Cost = 0; in getIntImmCost() local
58 Cost += getIntImmCost(Val); in getIntImmCost()
61 return std::max(1, Cost); in getIntImmCost()
122 int Cost = AArch64TTIImpl::getIntImmCost(Imm, Ty); in getIntImmCost() local
123 return (Cost <= NumConstants * TTI::TCC_Basic) in getIntImmCost()
125 : Cost; in getIntImmCost()
151 int Cost = AArch64TTIImpl::getIntImmCost(Imm, Ty); in getIntImmCost() local
152 return (Cost <= NumConstants * TTI::TCC_Basic) in getIntImmCost()
154 : Cost; in getIntImmCost()
289 return Entry->Cost; in getCastInstrCost()
[all …]
/external/llvm/lib/Target/PowerPC/
DPPCTargetTransformInfo.cpp340 int Cost = BaseT::getMemoryOpCost(Opcode, Src, Alignment, AddressSpace); in getMemoryOpCost() local
345 return Cost; in getMemoryOpCost()
365 return Cost + LT.first; // Add the cost of the permutations. in getMemoryOpCost()
372 return Cost; in getMemoryOpCost()
378 Cost += LT.first*(SrcBytes/Alignment-1); in getMemoryOpCost()
385 Cost += getVectorInstrCost(Instruction::ExtractElement, Src, i); in getMemoryOpCost()
387 return Cost; in getMemoryOpCost()
402 int Cost = getMemoryOpCost(Opcode, VecTy, Alignment, AddressSpace); in getInterleavedMemoryOpCost() local
409 Cost += Factor*(LT.first-1); in getInterleavedMemoryOpCost()
411 return Cost; in getInterleavedMemoryOpCost()
/external/webrtc/webrtc/modules/rtp_rtcp/source/
Dvp8_partition_aggregator.cc51 int PartitionTreeNode::Cost(size_t penalty) { in Cost() function in webrtc::PartitionTreeNode
125 if (left->Cost(penalty) <= right->Cost(penalty)) { in GetOptimalNode()
133 if (second->Cost(penalty) <= first->Cost(penalty)) { in GetOptimalNode()
136 if (second->Cost(penalty) < first->Cost(penalty)) { in GetOptimalNode()
/external/llvm/lib/Transforms/Scalar/
DConstantHoisting.cpp82 void addUser(Instruction *Inst, unsigned Idx, unsigned Cost) { in addUser()
83 CumulativeCost += Cost; in addUser()
279 unsigned Cost; in collectConstantCandidates() local
283 Cost = TTI->getIntImmCost(IntrInst->getIntrinsicID(), Idx, in collectConstantCandidates()
286 Cost = TTI->getIntImmCost(Inst->getOpcode(), Idx, ConstInt->getValue(), in collectConstantCandidates()
290 if (Cost > TargetTransformInfo::TCC_Basic) { in collectConstantCandidates()
298 ConstCandVec[Itr->second].addUser(Inst, Idx, Cost); in collectConstantCandidates()
301 << " with cost " << Cost << '\n'; in collectConstantCandidates()
305 << Cost << '\n'; in collectConstantCandidates()
/external/llvm/lib/Target/ARM/
DARMTargetTransformInfo.cpp66 return LT.first * Entry->Cost; in getCastInstrCost()
157 return Entry->Cost; in getCastInstrCost()
187 return Entry->Cost; in getCastInstrCost()
218 return Entry->Cost; in getCastInstrCost()
237 return Entry->Cost; in getCastInstrCost()
288 return Entry->Cost; in getCmpSelInstrCost()
356 return LT.first * Entry->Cost; in getShuffleCost()
381 return LT.first * Entry->Cost; in getShuffleCost()
440 return LT.first * Entry->Cost; in getArithmeticInstrCost()
442 int Cost = BaseT::getArithmeticInstrCost(Opcode, Ty, Op1Info, Op2Info, in getArithmeticInstrCost() local
[all …]
/external/llvm/tools/llvm-diff/
DDifferenceEngine.cpp476 DiffEntry() : Cost(0) {} in DiffEntry()
478 unsigned Cost; member
508 Cur[I].Cost = I * LeftCost; in runBlockDiff()
516 Next[0].Cost += RightCost; in runBlockDiff()
523 Next[Index].Cost += MatchCost; in runBlockDiff()
526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { in runBlockDiff()
528 Next[Index].Cost += LeftCost; in runBlockDiff()
532 Next[Index].Cost += RightCost; in runBlockDiff()

123