Home
last modified time | relevance | path

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

12

/external/llvm/utils/PerfectShuffle/
DPerfectShuffle.cpp88 unsigned Cost; // Number of instrs used to generate this value. member
92 ShuffleVal() : Cost(1000000) {} in ShuffleVal()
108 unsigned Cost; member
112 : ShuffleMask(shufflemask), OpNum(opnum), Name(name), 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,
165 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess=0 };
177 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false };
197 Cost = NumTraits<Scalar>::AddCost,
217 Cost = 2 * NumTraits<Scalar>::MulCost,
233 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
DVectorwiseOp.h56 typedef typename MemberOp::template Cost<InputScalar,int(TraversalSize)> CostOpType;
58 typedef typename MemberOp::template Cost<InputScalar,TraversalSize> CostOpType;
109 template<typename Scalar, int Size> struct Cost \
122 EIGEN_MEMBER_FUNCTOR(hypotNorm, (Size-1) * functor_traits<scalar_hypot_op<Scalar> >::Cost );
138 template<typename _Scalar, int Size> struct Cost
139 { enum { value = (Size-1) * functor_traits<BinaryOp>::Cost }; };
DRedux.h53 Cost = ( Derived::SizeAtCompileTime == Dynamic enumerator
55 || (Derived::SizeAtCompileTime!=1 && functor_traits<Func>::Cost == Dynamic)
58 + (Derived::SizeAtCompileTime-1) * functor_traits<Func>::Cost,
64 Unrolling = Cost != Dynamic && Cost <= UnrollingLimit
DRandom.h25 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; };
/external/llvm/utils/TableGen/
DDAGISelEmitter.cpp43 unsigned Cost = 0; in getResultPatternCost() local
46 Cost++; in getResultPatternCost()
49 Cost += 10; in getResultPatternCost()
52 Cost += getResultPatternCost(P->getChild(i), CGP); in getResultPatternCost()
53 return Cost; in getResultPatternCost()
62 unsigned Cost = 0; in getResultPatternSize() local
65 Cost += Op->getValueAsInt("CodeSize"); in getResultPatternSize()
68 Cost += getResultPatternSize(P->getChild(i), CGP); in getResultPatternSize()
69 return Cost; in getResultPatternSize()
/external/llvm/lib/CodeGen/
DRegisterClassInfo.cpp98 unsigned Cost = TRI->getCostPerUse(PhysReg); in compute() local
99 MinCost = std::min(MinCost, Cost); in compute()
105 if (Cost != LastCost) in compute()
108 LastCost = Cost; in compute()
117 unsigned Cost = TRI->getCostPerUse(PhysReg); in compute() local
118 if (Cost != LastCost) in compute()
121 LastCost = Cost; in compute()
DBasicTargetTransformInfo.cpp172 unsigned Cost = 0; in getScalarizationOverhead() local
176 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); in getScalarizationOverhead()
178 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); in getScalarizationOverhead()
181 return Cost; in getScalarizationOverhead()
222 unsigned Cost = TopTTI->getArithmeticInstrCost(Opcode, Ty->getScalarType()); in getArithmeticInstrCost() local
225 return getScalarizationOverhead(Ty, true, true) + Num * Cost; in getArithmeticInstrCost()
306 unsigned Cost = TopTTI->getCastInstrCost(Opcode, Dst->getScalarType(), in getCastInstrCost() local
311 return getScalarizationOverhead(Dst, true, true) + Num * Cost; in getCastInstrCost()
355 unsigned Cost = TopTTI->getCmpSelInstrCost(Opcode, ValTy->getScalarType(), in getCmpSelInstrCost() local
360 return getScalarizationOverhead(ValTy, true, false) + Num * Cost; in getCmpSelInstrCost()
[all …]
DRegAllocGreedy.cpp462 unsigned Cost = TRI->getCostPerUse(PhysReg); in tryAssign() local
465 if (!Cost) in tryAssign()
468 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost in tryAssign()
470 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); in tryAssign()
530 EvictionCost Cost; in canEvictInterference() local
562 Cost.BrokenHints += 10; in canEvictInterference()
567 Cost.BrokenHints += BreaksHint; in canEvictInterference()
568 Cost.MaxWeight = std::max(Cost.MaxWeight, Intf->weight); in canEvictInterference()
570 if (!(Cost < MaxCost)) in canEvictInterference()
577 MaxCost = Cost; in canEvictInterference()
[all …]
DMachineLICM.cpp208 bool CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, bool Cheap);
1070 bool MachineLICM::CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, in CanCauseHighRegPressure() argument
1072 for (DenseMap<unsigned, int>::iterator CI = Cost.begin(), CE = Cost.end(); in CanCauseHighRegPressure()
1079 int Cost = CI->second; in CanCauseHighRegPressure() local
1088 if (RP[RCId] + Cost >= Limit) in CanCauseHighRegPressure()
1105 DenseMap<unsigned, int> Cost; in UpdateBackTraceRegPressure() local
1117 DenseMap<unsigned, int>::iterator CI = Cost.find(RCId); in UpdateBackTraceRegPressure()
1118 if (CI != Cost.end()) in UpdateBackTraceRegPressure()
1121 Cost.insert(std::make_pair(RCId, RCCost)); in UpdateBackTraceRegPressure()
1123 DenseMap<unsigned, int>::iterator CI = Cost.find(RCId); in UpdateBackTraceRegPressure()
[all …]
DRegAllocFast.cpp466 unsigned Cost = 0; in calcSpillCost() local
473 ++Cost; in calcSpillCost()
480 Cost += I->Dirty ? spillDirty : spillClean; in calcSpillCost()
485 return Cost; in calcSpillCost()
528 unsigned Cost = calcSpillCost(Hint); in allocVirtReg() local
529 if (Cost < spillDirty) { in allocVirtReg()
530 if (Cost) in allocVirtReg()
554 unsigned Cost = calcSpillCost(*I); in allocVirtReg() local
556 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); in allocVirtReg()
559 if (Cost == 0) { in allocVirtReg()
[all …]
/external/llvm/lib/Target/X86/
DX86TargetTransformInfo.cpp194 return LT.first * AVX1CostTable[Idx].Cost; in getArithmeticInstrCost()
207 return LT.first * CustomLowered[Idx].Cost; in getArithmeticInstrCost()
226 unsigned Cost = 1; in getShuffleCost() local
228 Cost = 3; // Extract + insert + copy. in getShuffleCost()
231 return Cost * LT.first; in getShuffleCost()
270 return AVXConversionTbl[Idx].Cost; in getCastInstrCost()
315 return LT.first * AVX2CostTbl[Idx].Cost; in getCmpSelInstrCost()
321 return LT.first * AVX1CostTbl[Idx].Cost; in getCmpSelInstrCost()
327 return LT.first * SSE42CostTbl[Idx].Cost; in getCmpSelInstrCost()
365 unsigned Cost = LT.first * 1; in getMemoryOpCost() local
[all …]
/external/llvm/test/Analysis/CostModel/X86/
Dintrinsic-cost.ll24 ; CORE2: Printing analysis 'Cost Model Analysis' for function 'test1':
25 ; CORE2: Cost Model: Found an estimated cost of 400 for instruction: %2 = call <4 x float> @llvm.…
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…
/external/llvm/lib/Analysis/IPA/
DInlineCost.cpp55 int Cost; member in __anon4296eb6c0111::CallAnalyzer
139 : TD(TD), TTI(TTI), F(Callee), Threshold(Threshold), Cost(0), in CallAnalyzer()
152 int getCost() { return Cost; } in getCost()
198 Cost += CostIt->second; in disableSROA()
744 Cost += CS.arg_size() * InlineConstants::InstrCost; in visitCallSite()
749 Cost += InlineConstants::CallPenalty; in visitCallSite()
761 Cost += CS.arg_size() * InlineConstants::InstrCost; in visitCallSite()
778 Cost -= std::max(0, InlineConstants::IndirectCallThreshold - CA.getCost()); in visitCallSite()
821 Cost += InlineConstants::InstrCost; in analyzeBlock()
843 if (Cost > (Threshold + VectorBonus)) in analyzeBlock()
[all …]
/external/llvm/include/llvm/Target/
DCostTable.h25 unsigned Cost; member
46 unsigned Cost; member
/external/llvm/lib/Target/PowerPC/
DPPCTargetTransformInfo.cpp226 unsigned Cost = LT.first * 1; in getMemoryOpCost() local
232 Cost *= (SrcBytes/Alignment); in getMemoryOpCost()
234 return Cost; in getMemoryOpCost()
/external/llvm/test/Analysis/CostModel/ARM/
Dgep.ll7 ; Cost of scalar integer geps should be one. We can't always expect it to be
19 ; Cost of scalar floating point geps should be one. We cannot fold the address
27 ; Cost of vector geps should be one. We cannot fold the address computation.
/external/llvm/tools/llvm-diff/
DDifferenceEngine.cpp478 DiffEntry() : Cost(0) {} in DiffEntry()
480 unsigned Cost; member
510 Cur[I].Cost = I * LeftCost; in runBlockDiff()
518 Next[0].Cost += RightCost; in runBlockDiff()
525 Next[Index].Cost += MatchCost; in runBlockDiff()
528 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { in runBlockDiff()
530 Next[Index].Cost += LeftCost; in runBlockDiff()
534 Next[Index].Cost += RightCost; in runBlockDiff()
/external/llvm/lib/Target/ARM/
DARMTargetTransformInfo.cpp194 return LT.first * NEONFltDblTbl[Idx].Cost; in getCastInstrCost()
278 return NEONVectorConversionTbl[Idx].Cost; in getCastInstrCost()
310 return NEONFloatConversionTbl[Idx].Cost; in getCastInstrCost()
343 return NEONIntegerConversionTbl[Idx].Cost; in getCastInstrCost()
365 return ARMIntegerConversionTbl[Idx].Cost; in getCastInstrCost()
407 return NEONVectorSelectTbl[Idx].Cost; in getCmpSelInstrCost()
449 return LT.first * NEONShuffleTbl[Idx].Cost; in getShuffleCost()
/external/llvm/lib/Analysis/
DCostModel.cpp216 unsigned Cost = getInstructionCost(Inst); in print() local
217 if (Cost != (unsigned)-1) in print()
218 OS << "Cost Model: Found an estimated cost of " << Cost; in print()
/external/llvm/lib/Transforms/Vectorize/
DLoopVectorize.cpp563 unsigned Cost; // Cost of the loop with that width member
698 VF.Width, VF.Cost); in runOnLoop()
2999 float Cost = expectedCost(1); in selectVectorizationFactor() local
3001 DEBUG(dbgs() << "LV: Scalar loop costs: "<< (int)Cost << ".\n"); in selectVectorizationFactor()
3009 if (VectorCost < Cost) { in selectVectorizationFactor()
3010 Cost = VectorCost; in selectVectorizationFactor()
3017 Factor.Cost = Width * Cost; in selectVectorizationFactor()
3261 unsigned Cost = 0; in expectedCost() local
3276 Cost += C; in expectedCost()
3287 Cost += BlockCost; in expectedCost()
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGRRList.cpp278 unsigned &RegClass, unsigned &Cost, in GetCostForDef() argument
292 Cost = 1; in GetCostForDef()
301 Cost = 1; in GetCostForDef()
311 Cost = 1; in GetCostForDef()
314 Cost = TLI->getRepRegClassCostFor(VT); in GetCostForDef()
1961 unsigned RCId, Cost; in HighRegPressure() local
1962 GetCostForDef(RegDefPos, TLI, TII, TRI, RCId, Cost, MF); in HighRegPressure()
1964 if ((RegPressure[RCId] + Cost) >= RegLimit[RCId]) in HighRegPressure()
2075 unsigned RCId, Cost; in scheduledNode() local
2076 GetCostForDef(RegDefPos, TLI, TII, TRI, RCId, Cost, MF); in scheduledNode()
[all …]
DScheduleDAGSDNodes.cpp113 unsigned &PhysReg, int &Cost) { in CheckForPhysRegDependency() argument
129 Cost = RC->getCopyCost(); in CheckForPhysRegDependency()
469 int Cost = 1; in AddSchedEdges() local
471 CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); in AddSchedEdges()
479 if (Cost >= 0 && !StressSched) in AddSchedEdges()

12