/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 | 45 unsigned Cost = 0; local 48 Cost++; 51 Cost += 10; 54 Cost += getResultPatternCost(P->getChild(i), CGP); 55 return Cost; 64 unsigned Cost = 0; local 67 Cost += Op->getValueAsInt("CodeSize"); 70 Cost += getResultPatternSize(P->getChild(i), CGP); 71 return Cost;
|
/external/eigen/Eigen/src/Core/ |
H A D | Functors.h | 37 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20540 65 Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost)/2, // rough estimate! enumerator in enum:Eigen::internal::functor_traits::__anon20542 94 Cost = NumTraits<LhsScalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20544 117 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20545 140 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20546 166 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess=0 }; enumerator in enum:Eigen::internal::functor_traits::__anon20547 178 enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; enumerator in enum:Eigen::internal::functor_traits::__anon20548 198 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20549 223 Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost), // rough estimate! enumerator in enum:Eigen::internal::functor_traits::__anon20551 241 Cost enumerator in enum:Eigen::internal::functor_traits::__anon20552 257 Cost = NumTraits<bool>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20553 279 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20554 300 Cost = NumTraits<Scalar>::AddCost, enumerator in enum:Eigen::internal::functor_traits::__anon20555 320 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasAbs2 }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20556 337 Cost = NumTraits<Scalar>::IsComplex ? NumTraits<Scalar>::AddCost : 0, enumerator in enum:Eigen::internal::functor_traits::__anon20557 355 { enum { Cost = is_same<Scalar, NewType>::value ? 0 : NumTraits<NewType>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20558 370 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20559 385 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20560 400 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20561 415 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20562 431 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasExp }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20563 447 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasLog }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20564 475 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20565 487 { enum { Cost = NumTraits<Scalar1>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20566 510 { enum { Cost = 2 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasDiv }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20567 528 { enum { Cost = 1, PacketAccess = packet_traits<Scalar>::Vectorizable, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20568 537 { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = false, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20569 608 { enum { Cost = 1, PacketAccess = packet_traits<Scalar>::HasSetLinear, IsRepeatable = true }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20570 679 { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasAdd }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20577 694 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20578 713 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20579 732 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20580 752 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20581 771 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20582 790 Cost = 5 * NumTraits<Scalar>::MulCost, enumerator in enum:Eigen::internal::functor_traits::__anon20583 809 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20584 839 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasDiv }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20585 855 { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20586 871 { enum { Cost = 2*NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20587 877 { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20588 881 { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20589 885 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20590 889 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20591 893 { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20592 897 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20593 901 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20594 905 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20595 909 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20596 913 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20597 917 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20598 921 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20599 925 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20600 929 { enum { Cost = 1, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20601 933 { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20602 937 { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20603 941 { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20604 945 { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20605 951 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20606 955 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20607 959 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20608 963 { enum { Cost = 0, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20609 967 { enum { Cost = functor_traits<T0>::Cost + functor_traits<T1>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20610 971 { enum { Cost = functor_traits<T0>::Cost + functor_traits<T1>::Cost + functor_traits<T2>::Cost, PacketAccess = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20611 [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::__anon20723 161 Cost = NumTraits<Scalar>::AddCost enumerator in enum:Eigen::internal::functor_traits::__anon20724
|
H A D | Random.h | 25 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; }; enumerator in enum:Eigen::internal::functor_traits::__anon20671
|
H A D | Redux.h | 53 Cost = ( Derived::SizeAtCompileTime == Dynamic enumerator in enum:Eigen::internal::redux_traits::__anon20675 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; 110 template<typename Scalar, int Size> struct Cost \ 123 EIGEN_MEMBER_FUNCTOR(hypotNorm, (Size-1) * functor_traits<scalar_hypot_op<Scalar> >::Cost ); 139 template<typename _Scalar, int Size> struct Cost struct in struct:Eigen::internal::member_redux 140 { enum { value = (Size-1) * functor_traits<BinaryOp>::Cost }; };
|
H A D | CwiseUnaryOp.h | 50 CoeffReadCost = _XprTypeNested::CoeffReadCost + functor_traits<UnaryOp>::Cost
|
/external/llvm/lib/CodeGen/ |
H A D | RegisterClassInfo.cpp | 102 unsigned Cost = TRI->getCostPerUse(PhysReg); local 103 MinCost = std::min(MinCost, Cost); 109 if (Cost != LastCost) 112 LastCost = Cost; 121 unsigned Cost = TRI->getCostPerUse(PhysReg); local 122 if (Cost != LastCost) 125 LastCost = Cost;
|
H A D | BasicTargetTransformInfo.cpp | 265 unsigned Cost = 0; local 269 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 271 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); 274 return Cost; 323 unsigned Cost = TopTTI->getArithmeticInstrCost(Opcode, Ty->getScalarType()); local 326 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 335 unsigned Cost = 0; local 344 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 345 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); 347 return Cost; 429 unsigned Cost = TopTTI->getCastInstrCost(Opcode, Dst->getScalarType(), local 479 unsigned Cost = TopTTI->getCmpSelInstrCost(Opcode, ValTy->getScalarType(), local 505 unsigned Cost = LT.first; local 610 unsigned Cost = TopTTI->getIntrinsicInstrCost(IID, RetTy->getScalarType(), local [all...] |
H A D | MachineLICM.cpp | 209 bool CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, bool Cheap); 1069 bool MachineLICM::CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, argument 1071 for (DenseMap<unsigned, int>::iterator CI = Cost.begin(), CE = Cost.end(); 1078 int Cost = CI->second; local 1087 if (RP[RCId] + Cost >= Limit) 1104 DenseMap<unsigned, int> Cost; 1116 DenseMap<unsigned, int>::iterator CI = Cost.find(RCId); 1117 if (CI != Cost.end()) 1120 Cost [all...] |
H A D | RegAllocFast.cpp | 464 unsigned Cost = 0; local 471 ++Cost; 478 Cost += I->Dirty ? spillDirty : spillClean; 483 return Cost; 526 unsigned Cost = calcSpillCost(Hint); local 527 if (Cost < spillDirty) { 528 if (Cost) 552 unsigned Cost = calcSpillCost(*I); local 554 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); 556 // Cost i [all...] |
H A D | RegAllocGreedy.cpp | 92 cl::desc("Cost for first time use of callee-saved register."), 216 /// Cost of evicting interference. 595 unsigned Cost = TRI->getCostPerUse(PhysReg); local 598 if (!Cost) 601 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost 603 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); 694 EvictionCost Cost; local 726 Cost.BrokenHints += 10; 731 Cost.BrokenHints += BreaksHint; 732 Cost 875 addSplitConstraints(InterferenceCache::Cursor Intf, BlockFrequency &Cost) argument 1053 BlockFrequency Cost; local 1079 BlockFrequency Cost = 0; local 1356 BlockFrequency Cost; local 1362 MBFI->printBlockFreq(dbgs(), Cost)); local [all...] |
/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 47 /// Type Conversion Cost Table 53 unsigned Cost; member in struct:llvm::TypeConversionCostTblEntry
|
/external/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 202 return LT.first * AVX2UniformConstCostTable[Idx].Cost; 251 return LT.first * AVX2CostTable[Idx].Cost; 287 return LT.first * SSE2UniformConstCostTable[Idx].Cost; 349 return LT.first * SSE2CostTable[Idx].Cost; 382 return LT.first * AVX1CostTable[Idx].Cost; 394 return LT.first * CustomLowered[Idx].Cost; 415 unsigned Cost = 1; local 417 Cost = 3; // Extract + insert + copy. 420 return Cost * LT.first; 452 return LT.first * AVXAltShuffleTbl[Idx].Cost; 766 unsigned Cost = 0; local 797 unsigned Cost = TargetTransformInfo::getMemoryOpCost(Opcode, local 814 unsigned Cost = LT.first * 1; local 954 unsigned Cost = 0; local 1023 unsigned Cost = X86TTI::getIntImmCost(Imm, Ty); local [all...] |
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.cc | 51 int PartitionTreeNode::Cost(int penalty) { function in class:webrtc::PartitionTreeNode 130 if (left->Cost(penalty) <= right->Cost(penalty)) { 138 if (second->Cost(penalty) <= first->Cost(penalty)) { 141 if (second->Cost(penalty) < first->Cost(penalty)) {
|
H A D | vp8_partition_aggregator.h | 41 int Cost(int penalty);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64TargetTransformInfo.cpp | 172 unsigned Cost = 0; local 176 Cost += getIntImmCost(Val); 179 return std::max(1U, Cost); 240 unsigned Cost = AArch64TTI::getIntImmCost(Imm, Ty); local 241 return (Cost <= NumConstants * TCC_Basic) 242 ? static_cast<unsigned>(TCC_Free) : Cost; 268 unsigned Cost = AArch64TTI::getIntImmCost(Imm, Ty); local 269 return (Cost <= NumConstants * TCC_Basic) 270 ? static_cast<unsigned>(TCC_Free) : Cost; 373 return ConversionTbl[Idx].Cost; [all...] |
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 389 unsigned Cost = local 395 return Cost; 408 Cost += LT.first*(SrcBytes/Alignment-1); 415 Cost += getVectorInstrCost(Instruction::ExtractElement, Src, i); 418 return Cost;
|
/external/llvm/lib/Analysis/IPA/ |
H A D | InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===// 56 int Cost; member in class:__anon25683::CallAnalyzer 145 : DL(DL), TTI(TTI), F(Callee), Threshold(Threshold), Cost(0), 159 int getCost() { return Cost; } 205 Cost += CostIt->second; 751 Cost += CS.arg_size() * InlineConstants::InstrCost; 756 Cost += InlineConstants::CallPenalty; 768 Cost += CS.arg_size() * InlineConstants::InstrCost; 785 Cost -= std::max(0, InlineConstants::IndirectCallThreshold - CA.getCost()); 832 Cost [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantHoisting.cpp | 81 void addUser(Instruction *Inst, unsigned Idx, unsigned Cost) { argument 82 CumulativeCost += Cost; 275 unsigned Cost; local 279 Cost = TTI->getIntImmCost(IntrInst->getIntrinsicID(), Idx, 282 Cost = TTI->getIntImmCost(Inst->getOpcode(), Idx, ConstInt->getValue(), 286 if (Cost > TargetTransformInfo::TCC_Basic) { 294 ConstCandVec[Itr->second].addUser(Inst, Idx, Cost); 297 << " with cost " << Cost << '\n'; 301 << Cost << '\n';
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 476 DiffEntry() : Cost(0) {} 478 unsigned Cost; member in struct:__anon26399::DiffEntry 508 Cur[I].Cost = I * LeftCost; 516 Next[0].Cost += RightCost; 523 Next[Index].Cost += MatchCost; 526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { 528 Next[Index].Cost += LeftCost; 532 Next[Index].Cost += RightCost;
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 201 return LT.first * NEONFltDblTbl[Idx].Cost; 293 return NEONVectorConversionTbl[Idx].Cost; 324 return NEONFloatConversionTbl[Idx].Cost; 356 return NEONIntegerConversionTbl[Idx].Cost; 376 return ARMIntegerConversionTbl[Idx].Cost; 419 return NEONVectorSelectTbl[Idx].Cost; 470 return LT.first * NEONShuffleTbl[Idx].Cost; 474 // Alt shuffle cost table for ARM. Cost is the number of instructions 495 return LT.first * NEONAltShuffleTbl[Idx].Cost; 556 return LT.first * CostTbl[Idx].Cost; 558 unsigned Cost = local [all...] |
/external/llvm/lib/Analysis/ |
H A D | CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===// 70 static const char cm_name[] = "Cost Model Analysis"; 528 unsigned Cost = getInstructionCost(Inst); local 529 if (Cost != (unsigned)-1) 530 OS << "Cost Model: Found an estimated cost of " << Cost; local 532 OS << "Cost Model: Unknown cost";
|