/external/eigen/Eigen/src/Core/ |
Random.h | 25 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; };
|
Visitor.h | 81 && (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
|
Redux.h | 53 Cost = ( Derived::SizeAtCompileTime == Dynamic 55 || (Derived::SizeAtCompileTime!=1 && functor_traits<Func>::Cost == Dynamic) 58 + (Derived::SizeAtCompileTime-1) * functor_traits<Func>::Cost, 64 Unrolling = Cost != Dynamic && Cost <= UnrollingLimit
|
Functors.h | 37 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...] |
VectorwiseOp.h | 56 typedef typename MemberOp::template Cost<InputScalar,int(TraversalSize)> CostOpType; 58 typedef typename MemberOp::template Cost<InputScalar,TraversalSize> CostOpType; 104 #define EIGEN_MEMBER_FUNCTOR(MEMBER,COST) \ 109 template<typename Scalar, int Size> struct Cost \ 110 { enum { value = 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 }; };
|
/external/llvm/include/llvm/Target/ |
CostTable.h | 1 //===-- CostTable.h - Instruction Cost Table handling -----------*- C++ -*-===// 11 /// \brief Cost tables and simple lookup functions 20 /// Cost Table Entry 25 unsigned Cost; 28 /// Find in cost table, TypeTy must be comparable by == 40 /// Type Conversion Cost Table 46 unsigned Cost; 49 /// Find in type conversion cost table, TypeTy must be comparable by ==
|
/external/eigen/blas/ |
level1_cplx_impl.h | 21 enum { Cost = 3 * NumTraits<Scalar>::AddCost, PacketAccess = 0 };
|
/external/llvm/include/llvm/Analysis/ |
InlineCost.h | 1 //===- InlineCost.h - Cost analysis for inliner -----------------*- C++ -*-===// 41 /// \brief Represents the cost of inlining a function. 44 /// "never" be inlined. Otherwise, the cost represents a unitless amount; 49 /// directly tested to determine if inlining should occur given the cost and 50 /// threshold for this cost metric. 57 /// \brief The estimated cost of inlining this callsite. 58 const int Cost; 60 /// \brief The adjusted threshold against which this cost was computed. 64 InlineCost(int Cost, int Threshold) : Cost(Cost), Threshold(Threshold) { [all...] |
/external/llvm/lib/CodeGen/ |
RegisterClassInfo.cpp | 98 unsigned Cost = TRI->getCostPerUse(PhysReg); 99 MinCost = std::min(MinCost, Cost); 105 if (Cost != LastCost) 108 LastCost = Cost; 117 unsigned Cost = TRI->getCostPerUse(PhysReg); 118 if (Cost != LastCost) 121 LastCost = Cost;
|
BasicTargetTransformInfo.cpp | 172 unsigned Cost = 0; 176 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 178 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); 181 return Cost; 207 // TODO: Once we have extract/insert subvector cost we need to use them. 222 unsigned Cost = TopTTI->getArithmeticInstrCost(Opcode, Ty->getScalarType()); 223 // return the cost of multiple scalar invocation plus the cost of inserting 225 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 262 // If the cast is marked as legal (or promote) then assume low cost [all...] |
TargetLoweringBase.cpp | 835 /// of the register class for the specified type and its associated "cost". [all...] |
RegAllocFast.cpp | 438 // calcSpillCost - Return the cost of spilling clearing out PhysReg and 464 // This is a disabled register, add up cost of aliases. 466 unsigned Cost = 0; 473 ++Cost; 480 Cost += I->Dirty ? spillDirty : spillClean; 485 return Cost; 528 unsigned Cost = calcSpillCost(Hint); 529 if (Cost < spillDirty) { 530 if (Cost) 554 unsigned Cost = calcSpillCost(*I) [all...] |
RegAllocGreedy.cpp | 154 /// Cost of evicting interference. 462 unsigned Cost = TRI->getCostPerUse(PhysReg); 464 // Most registers have 0 additional cost. 465 if (!Cost) 468 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost 470 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); 510 /// @param MaxCost Only look for cheaper candidates and update with new cost 530 EvictionCost Cost; 562 Cost.BrokenHints += 10 [all...] |
MachineLICM.cpp | 206 /// check if hoisting an instruction of the given cost matrix can cause high 208 bool CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, bool Cheap); 244 /// index, return the ID and cost of its representative register class by 777 /// index, return the ID and cost of its representative register class. [all...] |
/external/eigen/test/ |
cwiseop.cpp | 28 enum { Cost = NumTraits<Scalar>::AddCost };
|
/external/eigen/test/eigen2/ |
eigen2_cwiseop.cpp | 19 enum { Cost = NumTraits<Scalar>::AddCost };
|
/external/llvm/lib/Target/PowerPC/ |
PPCTargetTransformInfo.cpp | 119 // PPC cost model. 200 // Estimated cost of a load-hit-store delay. This was obtained 226 unsigned Cost = LT.first * 1; 232 Cost *= (SrcBytes/Alignment); 234 return Cost;
|
/external/llvm/utils/TableGen/ |
DAGISelEmitter.cpp | 43 unsigned Cost = 0; 46 Cost++; 49 Cost += 10; 52 Cost += getResultPatternCost(P->getChild(i), CGP); 53 return Cost; 62 unsigned Cost = 0; 65 Cost += Op->getValueAsInt("CodeSize"); 68 Cost += getResultPatternSize(P->getChild(i), CGP); 69 return Cost; 74 // In particular, we want to match maximal patterns first and lowest cost withi [all...] |
/external/llvm/lib/Analysis/ |
CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===// 10 // This file defines the cost model analysis. It provides a very basic cost 12 // to approximate the cost of any IR instruction when lowered to machine 13 // instructions. The cost results are unit-less and the cost number represents 15 // branches are predicted, etc. The cost numbers can be added in order to 20 #define CM_NAME "cost-model" 43 /// Returns the expected cost of the instruction. 44 /// Returns -1 if the cost is unknown [all...] |
/external/llvm/lib/Target/X86/ |
X86TargetTransformInfo.cpp | 119 // X86 cost model. 184 // split factor of two in the cost table. Therefore, the cost here is 18 194 return LT.first * AVX1CostTable[Idx].Cost; 207 return LT.first * CustomLowered[Idx].Cost; 221 // We only estimate the cost of reverse shuffles. 226 unsigned Cost = 1; 228 Cost = 3; // Extract + insert + copy. 231 return Cost * LT.first; 270 return AVXConversionTbl[Idx].Cost; [all...] |
X86ISelDAGToDAG.cpp | [all...] |
/external/llvm/utils/PerfectShuffle/ |
PerfectShuffle.cpp | 88 unsigned Cost; // Number of instrs used to generate this value. 92 ShuffleVal() : Cost(1000000) {} 108 unsigned Cost; 111 unsigned cost = 1) 112 : ShuffleMask(shufflemask), OpNum(opnum), Name(name), Cost(cost) { 125 unsigned getCost() const { return Cost; } 153 assert(0 && "bad zero cost operation"); 164 if (ShufTab[ShufTab[ThisOp].Arg0].Cost == 0) { 178 if (ShufTab[ShufTab[ThisOp].Arg1].Cost == 0) [all...] |
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 478 DiffEntry() : Cost(0) {} 480 unsigned Cost; 510 Cur[I].Cost = I * LeftCost; 518 Next[0].Cost += RightCost; 525 Next[Index].Cost += MatchCost; 528 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { 530 Next[Index].Cost += LeftCost; 534 Next[Index].Cost += RightCost;
|
/external/llvm/lib/Analysis/IPA/ |
InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===// 10 // This file implements inline cost analysis. 14 #define DEBUG_TYPE "inline-cost" 55 int Cost; 75 // can cause dramatic shifts in the cost of inlining a function. 82 // The mapping of caller Alloca values to their accumulated cost savings. If 84 // cost must be added. 139 : TD(TD), TTI(TTI), F(Callee), Threshold(Threshold), Cost(0), 152 int getCost() { return Cost; } 154 // Keep a bunch of stats about the cost savings found so we can print the [all...] |
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
omxVCM4P10_MotionEstimationMB.c | 453 * Intra 4x4 Mode decision by calculating cost for all possible modes and 471 * [in] pBestCost - Cost for the Best Intra 4x4 mode 489 OMX_S32 Cost, BestCost; 531 Cost = BestCost = ARM_VCM4P10_MAX_COST; 533 /* Go through each mode for minim cost */ 553 &Cost, 557 if (Cost < BestCost) 559 BestCost = Cost; 761 * [in] nLamda - For calculating the cost 762 * [out] pBestCost - Minimum cost for encoding current block [all...] |