/freebsd-11.0-release/contrib/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...] |
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | TargetTransformInfo.cpp | 51 int Cost = TTIImpl->getOperationCost(Opcode, Ty, OpTy); local 52 assert(Cost >= 0 && "TTI should not produce negative costs!"); 53 return Cost; 57 int Cost = TTIImpl->getCallCost(FTy, NumArgs); local 58 assert(Cost >= 0 && "TTI should not produce negative costs!"); 59 return Cost; 64 int Cost = TTIImpl->getCallCost(F, Arguments); local 65 assert(Cost >= 0 && "TTI should not produce negative costs!"); 66 return Cost; 71 int Cost local 77 int Cost = TTIImpl->getUserCost(U); local 137 int Cost = TTIImpl->getScalingFactorCost(Ty, BaseGV, BaseOffset, HasBaseReg, local 185 int Cost = TTIImpl->getFPOpCost(Ty); local 191 int Cost = TTIImpl->getIntImmCost(Imm, Ty); local 198 int Cost = TTIImpl->getIntImmCost(Opcode, Idx, Imm, Ty); local 205 int Cost = TTIImpl->getIntImmCost(IID, Idx, Imm, Ty); local 226 int Cost = TTIImpl->getArithmeticInstrCost(Opcode, Ty, Opd1Info, Opd2Info, local 234 int Cost = TTIImpl->getShuffleCost(Kind, Ty, Index, SubTp); local 241 int Cost = TTIImpl->getCastInstrCost(Opcode, Dst, Src); local 247 int Cost = TTIImpl->getCFInstrCost(Opcode); local 254 int Cost = TTIImpl->getCmpSelInstrCost(Opcode, ValTy, CondTy); local 261 int Cost = TTIImpl->getVectorInstrCost(Opcode, Val, Index); local 269 int Cost = TTIImpl->getMemoryOpCost(Opcode, Src, Alignment, AddressSpace); local 277 int Cost = local 286 int Cost = TTIImpl->getGatherScatterOpCost(Opcode, DataTy, Ptr, VariableMask, local 295 int Cost = TTIImpl->getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices, local 303 int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Tys); local 310 int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Args); local 317 int Cost = TTIImpl->getCallInstrCost(F, RetTy, Tys); local 328 int Cost = TTIImpl->getAddressComputationCost(Tp, IsComplex); local 335 int Cost = TTIImpl->getReductionCost(Opcode, Ty, IsPairwiseForm); local [all...] |
H A D | InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===// 63 int Cost; member in class:__anon2393::CallAnalyzer 167 Cost(0), IsCallerRecursive(false), IsRecursiveCall(false), 180 int getCost() { return Cost; } 226 Cost += CostIt->second; 804 Cost += CS.arg_size() * InlineConstants::InstrCost; 809 Cost += InlineConstants::CallPenalty; 821 Cost += CS.arg_size() * InlineConstants::InstrCost; 838 Cost -= std::max(0, CA.getThreshold() - CA.getCost()); 885 Cost [all...] |
H A D | CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===// 70 static const char cm_name[] = "Cost Model Analysis"; 524 unsigned Cost = getInstructionCost(Inst); local 525 if (Cost != (unsigned)-1) 526 OS << "Cost Model: Found an estimated cost of " << Cost; local 528 OS << "Cost Model: Unknown cost";
|
/freebsd-11.0-release/contrib/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;
|
/freebsd-11.0-release/contrib/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 23 /// Cost Table Entry 27 unsigned Cost; member in struct:llvm::CostTblEntry 43 /// Type Conversion Cost Table 48 unsigned Cost; member in struct:llvm::TypeConversionCostTblEntry
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | RegisterClassInfo.cpp | 103 unsigned Cost = TRI->getCostPerUse(PhysReg); local 104 MinCost = std::min(MinCost, Cost); 110 if (Cost != LastCost) 113 LastCost = Cost; 122 unsigned Cost = TRI->getCostPerUse(PhysReg); local 123 if (Cost != LastCost) 126 LastCost = Cost;
|
H A D | MachineLICM.cpp | 186 bool CanCauseHighRegPressure(const DenseMap<unsigned, int> &Cost, 778 auto Cost = calcRegisterCost(MI, /*ConsiderSeen=*/true, ConsiderUnseenAsDef); local 779 for (const auto &RPIdAndCost : Cost) { 797 DenseMap<unsigned, int> Cost; local 799 return Cost; 828 if (Cost.find(*PS) == Cost.end()) 829 Cost[*PS] = RCCost; 831 Cost[*PS] += RCCost; 834 return Cost; 1023 CanCauseHighRegPressure(const DenseMap<unsigned, int>& Cost, bool CheapInstr) argument 1051 auto Cost = calcRegisterCost(MI, /*ConsiderSeen=*/false, local 1114 auto Cost = calcRegisterCost(&MI, /*ConsiderSeen=*/false, local [all...] |
H A D | RegAllocFast.cpp | 471 unsigned Cost = 0; local 478 ++Cost; 485 Cost += I->Dirty ? spillDirty : spillClean; 490 return Cost; 533 unsigned Cost = calcSpillCost(Hint); local 534 if (Cost < spillDirty) { 535 if (Cost) 559 unsigned Cost = calcSpillCost(*I); local 561 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); 563 // Cost i [all...] |
H A D | RegAllocGreedy.cpp | 100 cl::desc("Cost for first time use of callee-saved register."), 229 /// Cost of evicting interference. 643 unsigned Cost = TRI->getCostPerUse(PhysReg); local 646 if (!Cost) 649 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost 651 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost); 742 EvictionCost Cost; local 774 Cost.BrokenHints += 10; 779 Cost.BrokenHints += BreaksHint; 780 Cost 932 addSplitConstraints(InterferenceCache::Cursor Intf, BlockFrequency &Cost) argument 1108 BlockFrequency Cost; local 1134 BlockFrequency Cost = 0; local 1410 BlockFrequency Cost; local 1416 MBFI->printBlockFreq(dbgs(), Cost)); local [all...] |
H A D | MachineBlockPlacement.cpp | 103 cl::desc("Cost that models the probablistic risk of an instruction " 109 cl::desc("Cost of jump instructions."), 932 BlockFrequency Cost = 0; local 938 Cost += HeaderFallThroughCost; 944 Cost += ExitWithFreq.second; 963 Cost += ScaleBlockFrequency(TailBBFreq.getFrequency(), 971 Cost += ScaleBlockFrequency(TailToHeadFreq, MisfetchCost) + 977 << " to the top: " << Cost.getFrequency() << "\n"); 979 if (Cost < SmallestRotationCost) { 980 SmallestRotationCost = Cost; [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 340 int Cost = BaseT::getMemoryOpCost(Opcode, Src, Alignment, AddressSpace); local 345 return Cost; 365 return Cost + LT.first; // Add the cost of the permutations. 372 return Cost; 378 Cost += LT.first*(SrcBytes/Alignment-1); 385 Cost += getVectorInstrCost(Instruction::ExtractElement, Src, i); 387 return Cost; 402 int Cost = getMemoryOpCost(Opcode, VecTy, Alignment, AddressSpace); local 409 Cost += Factor*(LT.first-1); 411 return Cost; [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64TargetTransformInfo.cpp | 54 int Cost = 0; local 58 Cost += getIntImmCost(Val); 61 return std::max(1, Cost); 122 int Cost = AArch64TTIImpl::getIntImmCost(Imm, Ty); local 123 return (Cost <= NumConstants * TTI::TCC_Basic) 125 : Cost; 151 int Cost = AArch64TTIImpl::getIntImmCost(Imm, Ty); local 152 return (Cost <= NumConstants * TTI::TCC_Basic) 154 : Cost; 289 return Entry->Cost; 335 int Cost = getArithmeticInstrCost(Instruction::Add, Ty, Opd1Info, Opd2Info, local 463 int Cost = 0; local [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | BasicTTIImpl.h | 49 unsigned Cost = 0; local 53 Cost += static_cast<T *>(this) 56 Cost += static_cast<T *>(this) 60 return Cost; 66 unsigned Cost = 0; local 75 Cost += static_cast<T *>(this) 77 Cost += static_cast<T *>(this) 80 return Cost; 318 unsigned Cost = static_cast<T *>(this) local 323 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 409 unsigned Cost = static_cast<T *>(this)->getCastInstrCost( local 461 unsigned Cost = static_cast<T *>(this)->getCmpSelInstrCost( local 487 unsigned Cost = LT.first; local 527 unsigned Cost = static_cast<T *>(this)->getMemoryOpCost( local [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 105 int Cost = 2 * getArithmeticInstrCost(Instruction::AShr, Ty, Op1Info, local 108 Cost += getArithmeticInstrCost(Instruction::LShr, Ty, Op1Info, Op2Info, 111 Cost += getArithmeticInstrCost(Instruction::Add, Ty, Op1Info, Op2Info, 115 return Cost; 131 return LT.first * Entry->Cost; 145 return LT.first * Entry->Cost; 173 return LT.first * Entry->Cost; 208 return LT.first * Entry->Cost; 238 return LT.first * Entry->Cost; 287 return LT.first * Entry->Cost; 423 int Cost = 1; local 939 int Cost = 0; local 970 int Cost = BaseT::getMemoryOpCost(Opcode, VTy->getScalarType(), Alignment, local 984 int Cost = LT.first * 1; local 1026 int Cost = 0; local 1168 int Cost = 0; local 1256 int Cost = X86TTIImpl::getIntImmCost(Imm, Ty); local [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | SpeculativeExecution.cpp | 209 const unsigned Cost = ComputeSpeculationCost(&I, *TTI); local 210 if (Cost != UINT_MAX && isSafeToSpeculativelyExecute(&I) && 212 TotalSpeculationCost += Cost;
|
H A D | ConstantHoisting.cpp | 82 void addUser(Instruction *Inst, unsigned Idx, unsigned Cost) { argument 83 CumulativeCost += Cost; 279 unsigned Cost; local 283 Cost = TTI->getIntImmCost(IntrInst->getIntrinsicID(), Idx, 286 Cost = TTI->getIntImmCost(Inst->getOpcode(), Idx, ConstInt->getValue(), 290 if (Cost > TargetTransformInfo::TCC_Basic) { 298 ConstCandVec[Itr->second].addUser(Inst, Idx, Cost); 301 << " with cost " << Cost << '\n'; 305 << Cost << '\n';
|
H A D | LoopStrengthReduce.cpp | 862 class Cost { class in namespace:__anon3213 874 Cost() function in class:__anon3213::Cost 878 bool operator<(const Cost &Other) const; 925 void Cost::RateRegister(const SCEV *Reg, 973 void Cost::RatePrimaryRegister(const SCEV *Reg, 989 void Cost::RateFormula(const TargetTransformInfo &TTI, 998 assert(F.isCanonical() && "Cost is accurate only for canonical formula"); 1044 void Cost::Lose() { 1055 bool Cost::operator<(const Cost [all...] |
/freebsd-11.0-release/contrib/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 476 DiffEntry() : Cost(0) {} 478 unsigned Cost; member in struct:__anon4539::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;
|
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 66 return LT.first * Entry->Cost; 157 return Entry->Cost; 187 return Entry->Cost; 218 return Entry->Cost; 237 return Entry->Cost; 288 return Entry->Cost; 356 return LT.first * Entry->Cost; 362 // Alt shuffle cost table for ARM. Cost is the number of instructions 381 return LT.first * Entry->Cost; 440 return LT.first * Entry->Cost; 442 int Cost = BaseT::getArithmeticInstrCost(Opcode, Ty, Op1Info, Op2Info, local [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 1425 unsigned Cost; // Cost of the loop with that width member in struct:__anon3295::LoopVectorizationCostModel::VectorizationFactor 1811 unsigned IC = CM.selectInterleaveCount(OptForSize, VF.Width, VF.Cost); 3067 unsigned Cost = 0; local 3071 Cost += TTI.getVectorInstrCost(Instruction::InsertElement, Ty, i); 3073 Cost += TTI.getVectorInstrCost(Instruction::ExtractElement, Ty, i); 3076 return Cost; 3114 unsigned Cost = ScalarCallCost * VF + ScalarizationCost; local 3120 return Cost; 3124 if (VectorCallCost < Cost) { 4839 float Cost = expectedCost(1); local 5235 unsigned Cost = 0; local 5477 unsigned Cost = TTI.getInterleavedMemoryOpCost( local 5501 unsigned Cost = 0; local 5523 unsigned Cost = TTI.getAddressComputationCost(VectorTy); local 5589 unsigned Cost = 0; local [all...] |
H A D | SLPVectorizer.cpp | 1619 // Cost of wide load - cost of scalar loads. 1713 int Cost = 0; local 1757 Cost += TTI->getCostOfKeepingLiveOverCall(V); 1766 DEBUG(dbgs() << "SLP: SpillCost=" << Cost << "\n"); 1767 return Cost; 1771 int Cost = 0; local 1789 Cost += C; 1810 Cost += getSpillCost(); 1812 DEBUG(dbgs() << "SLP: Total Cost " << Cost 1817 int Cost = 0; local 3326 int Cost = R.getTreeCost(); local 3516 int Cost = R.getTreeCost(); local 3784 int Cost = V.getTreeCost() + getReductionCost(TTI, ReducedVals[i]); local [all...] |
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGSDNodes.cpp | 113 unsigned &PhysReg, int &Cost) { 135 Cost = RC->getCopyCost(); 467 int Cost = 1; 469 CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 477 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 | 279 unsigned &RegClass, unsigned &Cost, 293 Cost = 1; 302 Cost = 1; 310 // FIXME: Cost arbitrarily set to 1 because there doesn't seem to be a 312 Cost = 1; 315 Cost = TLI->getRepRegClassCostFor(VT); 1971 unsigned RCId, Cost; 1972 GetCostForDef(RegDefPos, TLI, TII, TRI, RCId, Cost, MF); 1974 if ((RegPressure[RCId] + Cost) >= RegLimit[RCId]) 2085 unsigned RCId, Cost; 275 GetCostForDef(const ScheduleDAGSDNodes::RegDefIter &RegDefPos, const TargetLowering *TLI, const TargetInstrInfo *TII, const TargetRegisterInfo *TRI, unsigned &RegClass, unsigned &Cost, const MachineFunction &MF) argument [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/ |
H A D | HexagonEarlyIfConv.cpp | 435 unsigned Cost = 0; local 443 Cost++; 449 Cost++; 451 return Cost;
|