/external/eigen/Eigen/src/Core/ |
H A D | Random.h | 25 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5465
|
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::__anon5515 161 Cost = NumTraits<Scalar>::AddCost enumerator in enum:Eigen::internal::functor_traits::__anon5516
|
H A D | Redux.h | 53 Cost = ( Derived::SizeAtCompileTime == Dynamic enumerator in enum:Eigen::internal::redux_traits::__anon5469 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 | Functors.h | 37 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5334 65 Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost)/2, // rough estimate! enumerator in enum:Eigen::internal::functor_traits::__anon5336 94 Cost = NumTraits<LhsScalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5338 117 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5339 140 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5340 165 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess=0 }; enumerator in enum:Eigen::internal::functor_traits::__anon5341 177 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; enumerator in enum:Eigen::internal::functor_traits::__anon5342 197 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5343 217 Cost = 2 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5344 233 Cost enumerator in enum:Eigen::internal::functor_traits::__anon5345 249 Cost = NumTraits<bool>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5346 271 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5347 292 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon5348 312 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasAbs2 }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5349 329 Cost = NumTraits<Scalar>::IsComplex ? NumTraits<Scalar>::AddCost : 0, enumerator in enum:Eigen::internal::functor_traits::__anon5350 347 { enum { Cost = is_same<Scalar, NewType>::value ? 0 : NumTraits<NewType>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5351 362 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5352 377 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5353 392 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5354 407 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5355 423 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasExp }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5356 439 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasLog }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5357 467 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5358 479 { enum { Cost = NumTraits<Scalar1>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5359 494 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5360 506 { enum { Cost = 2 * NumTraits<Scalar>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5361 542 { enum { Cost = 1, PacketAccess = packet_traits<Scalar>::Vectorizable, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5362 551 { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = false, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5363 614 { enum { Cost = 1, PacketAccess = packet_traits<Scalar>::HasSetLinear, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5364 683 { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasAdd }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5370 698 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5371 717 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5372 736 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5373 756 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5374 775 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5375 794 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon5376 813 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5377 843 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasDiv }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5378 859 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5379 875 { enum { Cost = 2*NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5380 881 { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5381 885 { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5382 889 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5383 893 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5384 897 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5385 901 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5386 905 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5387 909 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5388 913 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5389 917 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5390 921 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5391 925 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5392 929 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5393 933 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5394 937 { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5395 941 { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5396 945 { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5397 949 { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5398 955 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5399 959 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5400 963 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5401 967 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5402 971 { enum { Cost = functor_traits<T0>::Cost + functor_traits<T1>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5403 975 { enum { Cost = functor_traits<T0>::Cost + functor_traits<T1>::Cost + functor_traits<T2>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon5404 [all...] |
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 }; };
|
/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/include/llvm/Analysis/ |
H A D | InlineCost.h | 1 //===- InlineCost.h - Cost analysis for inliner -----------------*- C++ -*-===// 58 const int Cost; member in class:llvm::InlineCost 64 InlineCost(int Cost, int Threshold) : Cost(Cost), Threshold(Threshold) {} argument 67 static InlineCost get(int Cost, int Threshold) { argument 68 assert(Cost > AlwaysInlineCost && "Cost crosses sentinel value"); 69 assert(Cost < NeverInlineCost && "Cost crosse [all...] |
/external/llvm/lib/CodeGen/ |
H A D | RegisterClassInfo.cpp | 98 unsigned Cost = TRI->getCostPerUse(PhysReg); local 99 MinCost = std::min(MinCost, Cost); 105 if (Cost != LastCost) 108 LastCost = Cost; 117 unsigned Cost = TRI->getCostPerUse(PhysReg); local 118 if (Cost != LastCost) 121 LastCost = Cost;
|
H A D | BasicTargetTransformInfo.cpp | 172 unsigned Cost = 0; local 176 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 178 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); 181 return Cost; 222 unsigned Cost = TopTTI->getArithmeticInstrCost(Opcode, Ty->getScalarType()); local 225 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 306 unsigned Cost = TopTTI->getCastInstrCost(Opcode, Dst->getScalarType(), local 311 return getScalarizationOverhead(Dst, true, true) + Num * Cost; 355 unsigned Cost = TopTTI->getCmpSelInstrCost(Opcode, ValTy->getScalarType(), local 360 return getScalarizationOverhead(ValTy, true, false) + Num * Cost; 446 unsigned Cost = TopTTI->getIntrinsicInstrCost(IID, RetTy->getScalarType(), local [all...] |
H A D | TargetLoweringBase.cpp | 1026 uint8_t Cost; local 1027 tie(RRC, Cost) = findRepresentativeClass((MVT::SimpleValueType)i); 1029 RepRegClassCostForVT[i] = Cost; 1252 unsigned Cost = 1; local 1260 return std::make_pair(Cost, MTy.getSimpleVT()); 1263 Cost *= 2;
|
H A D | RegAllocFast.cpp | 466 unsigned Cost = 0; local 473 ++Cost; 480 Cost += I->Dirty ? spillDirty : spillClean; 485 return Cost; 528 unsigned Cost = calcSpillCost(Hint); local 529 if (Cost < spillDirty) { 530 if (Cost) 554 unsigned Cost = calcSpillCost(*I); local 556 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); 558 // Cost i [all...] |
H A D | RegAllocGreedy.cpp | 154 /// Cost of evicting interference. 462 unsigned Cost = TRI->getCostPerUse(PhysReg); local 465 if (!Cost) 468 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost 470 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); 530 EvictionCost Cost; local 562 Cost.BrokenHints += 10; 567 Cost.BrokenHints += BreaksHint; 568 Cost.MaxWeight = std::max(Cost 701 addSplitConstraints(InterferenceCache::Cursor Intf, float &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...] |
/external/eigen/test/ |
H A D | cwiseop.cpp | 28 enum { Cost = NumTraits<Scalar>::AddCost }; enumerator in enum:AddIfNull::__anon5802
|
/external/eigen/test/eigen2/ |
H A D | eigen2_cwiseop.cpp | 19 enum { Cost = NumTraits<Scalar>::AddCost }; enumerator in enum:AddIfNull::__anon5805
|
/external/eigen/blas/ |
H A D | level1_cplx_impl.h | 21 enum { Cost = 3 * NumTraits<Scalar>::AddCost, PacketAccess = 0 }; enumerator in enum:Eigen::internal::functor_traits::__anon5794
|
/external/llvm/lib/Analysis/ |
H A D | CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===// 63 static const char cm_name[] = "Cost Model Analysis"; 216 unsigned Cost = getInstructionCost(Inst); local 217 if (Cost != (unsigned)-1) 218 OS << "Cost Model: Found an estimated cost of " << Cost; local 220 OS << "Cost Model: Unknown cost";
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 226 unsigned Cost = LT.first * 1; local 232 Cost *= (SrcBytes/Alignment); 234 return Cost;
|
/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/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
|
H A D | ScheduleDAGRRList.cpp | 278 unsigned &RegClass, unsigned &Cost, 292 Cost = 1; 301 Cost = 1; 309 // FIXME: Cost arbitrarily set to 1 because there doesn't seem to be a 311 Cost = 1; 314 Cost = TLI->getRepRegClassCostFor(VT); 1961 unsigned RCId, Cost; 1962 GetCostForDef(RegDefPos, TLI, TII, TRI, RCId, Cost, MF); 1964 if ((RegPressure[RCId] + Cost) >= RegLimit[RCId]) 2075 unsigned RCId, Cost; 274 GetCostForDef(const ScheduleDAGSDNodes::RegDefIter &RegDefPos, const TargetLowering *TLI, const TargetInstrInfo *TII, const TargetRegisterInfo *TRI, unsigned &RegClass, unsigned &Cost, const MachineFunction &MF) argument [all...] |
/external/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 194 return LT.first * AVX1CostTable[Idx].Cost; 207 return LT.first * CustomLowered[Idx].Cost; 226 unsigned Cost = 1; local 228 Cost = 3; // Extract + insert + copy. 231 return Cost * LT.first; 270 return AVXConversionTbl[Idx].Cost; 315 return LT.first * AVX2CostTbl[Idx].Cost; 321 return LT.first * AVX1CostTbl[Idx].Cost; 327 return LT.first * SSE42CostTbl[Idx].Cost; 365 unsigned Cost local [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/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 478 DiffEntry() : Cost(0) {} 480 unsigned Cost; member in struct:__anon10022::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/IPA/ |
H A D | InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===// 55 int Cost; member in class:__anon9395::CallAnalyzer 139 : TD(TD), TTI(TTI), F(Callee), Threshold(Threshold), Cost(0), 152 int getCost() { return Cost; } 198 Cost += CostIt->second; 744 Cost += CS.arg_size() * InlineConstants::InstrCost; 749 Cost += InlineConstants::CallPenalty; 761 Cost += CS.arg_size() * InlineConstants::InstrCost; 778 Cost -= std::max(0, InlineConstants::IndirectCallThreshold - CA.getCost()); 821 Cost [all...] |