/external/llvm/include/llvm/Analysis/ |
H A D | InlineCost.h | 1 //===- InlineCost.h - Cost analysis for inliner -----------------*- C++ -*-===// 57 const int Cost; member in class:llvm::InlineCost 63 InlineCost(int Cost, int Threshold) : Cost(Cost), Threshold(Threshold) {} argument 66 static InlineCost get(int Cost, int Threshold) { argument 67 assert(Cost > AlwaysInlineCost && "Cost crosses sentinel value"); 68 assert(Cost < NeverInlineCost && "Cost crosse [all...] |
/external/llvm/utils/PerfectShuffle/ |
H A D | PerfectShuffle.cpp | 88 unsigned Cost; // Number of instrs used to generate this value. member in struct:ShuffleVal 92 ShuffleVal() : Cost(1000000) {} 108 unsigned Cost; member in struct:Operator 112 : ShuffleMask(shufflemask), OpNum(opnum), Name(name), Cost(cost) { 125 unsigned getCost() const { return Cost; } 164 if (ShufTab[ShufTab[ThisOp].Arg0].Cost == 0) { 178 if (ShufTab[ShufTab[ThisOp].Arg1].Cost == 0) { 196 Count += ShufTab[i].Cost < 100; 202 if (ShufTab[Elt].Cost == 0) return; 210 if (ShufTab[Arg0].Cost) [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelEmitter.cpp | 43 unsigned Cost = 0; local 46 Cost++; 49 Cost += 10; 52 Cost += getResultPatternCost(P->getChild(i), CGP); 53 return Cost; 62 unsigned Cost = 0; local 65 Cost += Op->getValueAsInt("CodeSize"); 68 Cost += getResultPatternSize(P->getChild(i), CGP); 69 return Cost;
|
/external/eigen/Eigen/src/Core/ |
H A D | Functors.h | 37 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16920 65 Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost)/2, // rough estimate! enumerator in enum:Eigen::internal::functor_traits::__anon16922 94 Cost = NumTraits<LhsScalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16924 117 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16925 140 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16926 165 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess=0 }; enumerator in enum:Eigen::internal::functor_traits::__anon16927 177 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; enumerator in enum:Eigen::internal::functor_traits::__anon16928 197 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16929 217 Cost = 2 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16930 233 Cost enumerator in enum:Eigen::internal::functor_traits::__anon16931 249 Cost = NumTraits<bool>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16932 271 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16933 292 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon16934 312 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasAbs2 }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16935 329 Cost = NumTraits<Scalar>::IsComplex ? NumTraits<Scalar>::AddCost : 0, enumerator in enum:Eigen::internal::functor_traits::__anon16936 347 { enum { Cost = is_same<Scalar, NewType>::value ? 0 : NumTraits<NewType>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16937 362 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16938 377 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16939 392 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16940 407 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16941 423 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasExp }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16942 439 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasLog }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16943 467 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16944 479 { enum { Cost = NumTraits<Scalar1>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16945 494 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16946 506 { enum { Cost = 2 * NumTraits<Scalar>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16947 542 { enum { Cost = 1, PacketAccess = packet_traits<Scalar>::Vectorizable, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16948 551 { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = false, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16949 614 { enum { Cost = 1, PacketAccess = packet_traits<Scalar>::HasSetLinear, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16950 683 { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasAdd }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16956 698 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16957 717 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16958 736 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16959 756 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16960 775 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16961 794 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon16962 813 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16963 843 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasDiv }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16964 859 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16965 875 { enum { Cost = 2*NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16966 881 { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16967 885 { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16968 889 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16969 893 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16970 897 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16971 901 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16972 905 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16973 909 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16974 913 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16975 917 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16976 921 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16977 925 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16978 929 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16979 933 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16980 937 { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16981 941 { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16982 945 { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16983 949 { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16984 955 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16985 959 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16986 963 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16987 967 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16988 971 { enum { Cost = functor_traits<T0>::Cost + functor_traits<T1>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16989 975 { enum { Cost = functor_traits<T0>::Cost + functor_traits<T1>::Cost + functor_traits<T2>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon16990 [all...] |
H A D | 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 enumerator in enum:Eigen::internal::functor_traits::__anon17101 161 Cost = NumTraits<Scalar>::AddCost enumerator in enum:Eigen::internal::functor_traits::__anon17102
|
H A D | Random.h | 25 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon17051
|
H A D | Redux.h | 53 Cost = ( Derived::SizeAtCompileTime == Dynamic enumerator in enum:Eigen::internal::redux_traits::__anon17055 55 || (Derived::SizeAtCompileTime!=1 && functor_traits<Func>::Cost == Dynamic) 58 + (Derived::SizeAtCompileTime-1) * functor_traits<Func>::Cost, 64 Unrolling = Cost != Dynamic && Cost <= UnrollingLimit
|
H A D | VectorwiseOp.h | 56 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 struct in struct:Eigen::internal::member_redux 139 { enum { value = (Size-1) * functor_traits<BinaryOp>::Cost }; };
|
H A D | CwiseUnaryOp.h | 50 CoeffReadCost = _XprTypeNested::CoeffReadCost + functor_traits<UnaryOp>::Cost
|
H A D | CwiseUnaryView.h | 41 CoeffReadCost = traits<_MatrixTypeNested>::CoeffReadCost + functor_traits<ViewOp>::Cost,
|
/external/llvm/include/llvm/Target/ |
H A D | 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; member in struct:llvm::CostTblEntry 40 /// Type Conversion Cost Table 46 unsigned Cost; member in struct:llvm::TypeConversionCostTblEntry
|
/external/llvm/lib/CodeGen/ |
H A D | RegisterClassInfo.cpp | 101 unsigned Cost = TRI->getCostPerUse(PhysReg); local 102 MinCost = std::min(MinCost, Cost); 108 if (Cost != LastCost) 111 LastCost = Cost; 120 unsigned Cost = TRI->getCostPerUse(PhysReg); local 121 if (Cost != LastCost) 124 LastCost = Cost;
|
H A D | BasicTargetTransformInfo.cpp | 194 unsigned Cost = 0; local 198 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 200 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); 203 return Cost; 252 unsigned Cost = TopTTI->getArithmeticInstrCost(Opcode, Ty->getScalarType()); local 255 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 337 unsigned Cost = TopTTI->getCastInstrCost(Opcode, Dst->getScalarType(), local 342 return getScalarizationOverhead(Dst, true, true) + Num * Cost; 387 unsigned Cost = TopTTI->getCmpSelInstrCost(Opcode, ValTy->getScalarType(), local 392 return getScalarizationOverhead(ValTy, true, false) + Num * Cost; 484 unsigned Cost = TopTTI->getIntrinsicInstrCost(IID, RetTy->getScalarType(), local [all...] |
H A D | RegAllocGreedy.cpp | 156 /// Cost of evicting interference. 482 unsigned Cost = TRI->getCostPerUse(PhysReg); local 485 if (!Cost) 488 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost 490 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); 577 EvictionCost Cost; local 609 Cost.BrokenHints += 10; 614 Cost.BrokenHints += BreaksHint; 615 Cost.MaxWeight = std::max(Cost 757 addSplitConstraints(InterferenceCache::Cursor Intf, BlockFrequency &Cost) argument [all...] |
H A D | MachineLICM.cpp | 208 bool CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, bool Cheap); 1070 bool MachineLICM::CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, argument 1072 for (DenseMap<unsigned, int>::iterator CI = Cost.begin(), CE = Cost.end(); 1079 int Cost = CI->second; local 1088 if (RP[RCId] + Cost >= Limit) 1105 DenseMap<unsigned, int> Cost; 1117 DenseMap<unsigned, int>::iterator CI = Cost.find(RCId); 1118 if (CI != Cost.end()) 1121 Cost [all...] |
H A D | RegAllocFast.cpp | 463 unsigned Cost = 0; local 470 ++Cost; 477 Cost += I->Dirty ? spillDirty : spillClean; 482 return Cost; 525 unsigned Cost = calcSpillCost(Hint); local 526 if (Cost < spillDirty) { 527 if (Cost) 551 unsigned Cost = calcSpillCost(*I); local 553 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); 555 // Cost i [all...] |
/external/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 217 return LT.first * AVX2CostTable[Idx].Cost; 245 return LT.first * SSE2UniformConstCostTable[Idx].Cost; 293 return LT.first * SSE2CostTable[Idx].Cost; 318 return LT.first * AVX1CostTable[Idx].Cost; 331 return LT.first * CustomLowered[Idx].Cost; 351 unsigned Cost = 1; local 353 Cost = 3; // Extract + insert + copy. 356 return Cost * LT.first; 394 return LTSrc.first * SSE2ConvTbl[Idx].Cost; 453 return AVXConversionTbl[Idx].Cost; 546 unsigned Cost = 0; local 577 unsigned Cost = TargetTransformInfo::getMemoryOpCost(Opcode, local 594 unsigned Cost = LT.first * 1; local [all...] |
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 230 unsigned Cost = LT.first * 1; local 236 Cost *= (SrcBytes/Alignment); 238 return Cost;
|
/external/llvm/lib/Analysis/IPA/ |
H A D | InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===// 55 int Cost; member in class:__anon21084::CallAnalyzer 139 : TD(TD), TTI(TTI), F(Callee), Threshold(Threshold), Cost(0), 152 int getCost() { return Cost; } 198 Cost += CostIt->second; 748 Cost += CS.arg_size() * InlineConstants::InstrCost; 753 Cost += InlineConstants::CallPenalty; 765 Cost += CS.arg_size() * InlineConstants::InstrCost; 782 Cost -= std::max(0, InlineConstants::IndirectCallThreshold - CA.getCost()); 825 Cost [all...] |
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 478 DiffEntry() : Cost(0) {} 480 unsigned Cost; member in struct:__anon21767::DiffEntry 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/ |
H A D | CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===// 63 static const char cm_name[] = "Cost Model Analysis"; 238 unsigned Cost = getInstructionCost(Inst); local 239 if (Cost != (unsigned)-1) 240 OS << "Cost Model: Found an estimated cost of " << Cost; local 242 OS << "Cost Model: Unknown cost";
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 198 return LT.first * NEONFltDblTbl[Idx].Cost; 290 return NEONVectorConversionTbl[Idx].Cost; 322 return NEONFloatConversionTbl[Idx].Cost; 355 return NEONIntegerConversionTbl[Idx].Cost; 377 return ARMIntegerConversionTbl[Idx].Cost; 420 return NEONVectorSelectTbl[Idx].Cost; 472 return LT.first * NEONShuffleTbl[Idx].Cost; 531 return LT.first * CostTbl[Idx].Cost;
|
/external/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 648 unsigned Cost; // Cost of the loop with that width member in struct:__anon21735::LoopVectorizationCostModel::VectorizationFactor 913 VF.Cost); 4127 float Cost = expectedCost(1); 4129 DEBUG(dbgs() << "LV: Scalar loop costs: "<< (int)Cost << ".\n"); 4137 if (VectorCost < Cost) { 4138 Cost = VectorCost; 4145 Factor.Cost = Width * Cost; 4393 unsigned Cost [all...] |
H A D | SLPVectorizer.cpp | 884 // Cost of wide load - cost of scalar loads. 903 int Cost = 0; local 923 Cost += C; 936 DEBUG(dbgs() << "SLP: Total Cost " << Cost + ExtractCost<< ".\n"); 937 return Cost + ExtractCost; 941 int Cost = 0; local 943 Cost += TTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 944 return Cost; 1687 int Cost local 1814 int Cost = R.getTreeCost(); local [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGSDNodes.cpp | 113 unsigned &PhysReg, int &Cost) { 129 Cost = RC->getCopyCost(); 469 int Cost = 1; 471 CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 479 if (Cost >= 0 && !StressSched) 110 CheckForPhysRegDependency(SDNode *Def, SDNode *User, unsigned Op, const TargetRegisterInfo *TRI, const TargetInstrInfo *TII, unsigned &PhysReg, int &Cost) argument
|