Home
last modified time | relevance | path

Searched refs:Cost (Results 1 – 25 of 31) 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) in InlineCost() argument
65 : Cost(Cost), Threshold(Threshold) {} in InlineCost()
68 static InlineCost get(int Cost, int Threshold) { in get() argument
69 assert(Cost > AlwaysInlineCost && "Cost crosses sentinel value"); in get()
70 assert(Cost < NeverInlineCost && "Cost crosses sentinel value"); in get()
71 return InlineCost(Cost, Threshold); in get()
82 return Cost < Threshold;
85 bool isAlways() const { return Cost == AlwaysInlineCost; } in isAlways()
86 bool isNever() const { return Cost == NeverInlineCost; } in isNever()
[all …]
/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 }; };
DCwiseUnaryOp.h50 CoeffReadCost = _XprTypeNested::CoeffReadCost + functor_traits<UnaryOp>::Cost
DCwiseUnaryView.h41 CoeffReadCost = traits<_MatrixTypeNested>::CoeffReadCost + functor_traits<ViewOp>::Cost,
DCwiseBinaryOp.h84 CoeffReadCost = LhsCoeffReadCost + RhsCoeffReadCost + functor_traits<BinaryOp>::Cost
DCwiseNullaryOp.h43 CoeffReadCost = functor_traits<NullaryOp>::Cost
/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/Analysis/
DInlineCost.cpp51 int Cost; member in __anon8a7661030111::CallAnalyzer
127 : TD(TD), F(Callee), Threshold(Threshold), Cost(0), in CallAnalyzer()
140 int getCost() { return Cost; } in getCost()
186 Cost += CostIt->second; in disableSROA()
635 Cost += CS.arg_size() * InlineConstants::InstrCost; in visitCallSite()
640 Cost += InlineConstants::CallPenalty; in visitCallSite()
652 Cost += CS.arg_size() * InlineConstants::InstrCost; in visitCallSite()
669 Cost -= std::max(0, InlineConstants::IndirectCallThreshold - CA.getCost()); in visitCallSite()
712 Cost += InlineConstants::InstrCost; in analyzeBlock()
727 if (!AlwaysInline && Cost > (Threshold + VectorBonus)) in analyzeBlock()
[all …]
/external/llvm/lib/CodeGen/
DRegAllocGreedy.cpp464 unsigned Cost = TRI->getCostPerUse(PhysReg); in tryAssign() local
467 if (!Cost) in tryAssign()
470 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost in tryAssign()
472 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); in tryAssign()
532 EvictionCost Cost; in canEvictInterference() local
564 Cost.BrokenHints += 10; in canEvictInterference()
569 Cost.BrokenHints += BreaksHint; in canEvictInterference()
570 Cost.MaxWeight = std::max(Cost.MaxWeight, Intf->weight); in canEvictInterference()
572 if (!(Cost < MaxCost)) in canEvictInterference()
579 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.cpp454 unsigned Cost = 0; in calcSpillCost() local
463 ++Cost; in calcSpillCost()
470 Cost += I->Dirty ? spillDirty : spillClean; in calcSpillCost()
475 return Cost; in calcSpillCost()
518 unsigned Cost = calcSpillCost(Hint); in allocVirtReg() local
519 if (Cost < spillDirty) { in allocVirtReg()
520 if (Cost) in allocVirtReg()
544 unsigned Cost = calcSpillCost(*I); in allocVirtReg() local
546 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); in allocVirtReg()
549 if (Cost == 0) { in allocVirtReg()
[all …]
/external/llvm/tools/llvm-diff/
DDifferenceEngine.cpp480 DiffEntry() : Cost(0) {} in DiffEntry()
482 unsigned Cost; member
512 Cur[I].Cost = I * LeftCost; in runBlockDiff()
520 Next[0].Cost += RightCost; in runBlockDiff()
527 Next[Index].Cost += MatchCost; in runBlockDiff()
530 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { in runBlockDiff()
532 Next[Index].Cost += LeftCost; in runBlockDiff()
536 Next[Index].Cost += RightCost; in runBlockDiff()
/external/llvm/lib/CodeGen/SelectionDAG/
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()
DScheduleDAGRRList.cpp269 unsigned &RegClass, unsigned &Cost, in GetCostForDef() argument
283 Cost = 1; in GetCostForDef()
293 Cost = 1; in GetCostForDef()
296 Cost = TLI->getRepRegClassCostFor(VT); in GetCostForDef()
1929 unsigned RCId, Cost; in HighRegPressure() local
1930 GetCostForDef(RegDefPos, TLI, TII, TRI, RCId, Cost, MF); in HighRegPressure()
1932 if ((RegPressure[RCId] + Cost) >= RegLimit[RCId]) in HighRegPressure()
2043 unsigned RCId, Cost; in scheduledNode() local
2044 GetCostForDef(RegDefPos, TLI, TII, TRI, RCId, Cost, MF); in scheduledNode()
2045 RegPressure[RCId] += Cost; in scheduledNode()
[all …]
/external/llvm/lib/Transforms/Scalar/
DLoopStrengthReduce.cpp768 class Cost { class
779 Cost() in Cost() function in __anon418e8d5c0411::Cost
783 bool operator<(const Cost &Other) const;
828 void Cost::RateRegister(const SCEV *Reg, in RateRegister()
876 void Cost::RatePrimaryRegister(const SCEV *Reg, in RatePrimaryRegister()
892 void Cost::RateFormula(const Formula &F, in RateFormula()
940 void Cost::Loose() { in Loose()
950 bool Cost::operator<(const Cost &Other) const { in operator <()
966 void Cost::print(raw_ostream &OS) const { in print()
982 void Cost::dump() const { in dump()
[all …]
/external/eigen/blas/
Dlevel1_cplx_impl.h21 enum { Cost = 3 * NumTraits<Scalar>::AddCost, PacketAccess = 0 };
/external/eigen/test/
Dcwiseop.cpp28 enum { Cost = NumTraits<Scalar>::AddCost }; enumerator
/external/eigen/test/eigen2/
Deigen2_cwiseop.cpp19 enum { Cost = NumTraits<Scalar>::AddCost }; enumerator
/external/eigen/Eigen/src/Core/util/
DXprHelper.h72 Cost = 10, enumerator
/external/llvm/lib/Target/X86/
DX86ISelDAGToDAG.cpp1119 int Cost = 0; in MatchAddressRecursively() local
1130 ++Cost; in MatchAddressRecursively()
1137 --Cost; in MatchAddressRecursively()
1143 --Cost; in MatchAddressRecursively()
1145 if (Cost >= 0) { in MatchAddressRecursively()

12