/freebsd-10-stable/contrib/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...] |
/freebsd-10-stable/contrib/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;
|
/freebsd-10-stable/contrib/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 | 205 unsigned Cost = 0; local 209 Cost += TopTTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 211 Cost += TopTTI->getVectorInstrCost(Instruction::ExtractElement, Ty, i); 214 return Cost; 263 unsigned Cost = TopTTI->getArithmeticInstrCost(Opcode, Ty->getScalarType()); local 266 return getScalarizationOverhead(Ty, true, true) + Num * Cost; 348 unsigned Cost = TopTTI->getCastInstrCost(Opcode, Dst->getScalarType(), local 353 return getScalarizationOverhead(Dst, true, true) + Num * Cost; 398 unsigned Cost = TopTTI->getCmpSelInstrCost(Opcode, ValTy->getScalarType(), local 403 return getScalarizationOverhead(ValTy, true, false) + Num * Cost; 497 unsigned Cost = TopTTI->getIntrinsicInstrCost(IID, RetTy->getScalarType(), local [all...] |
H A D | RegAllocGreedy.cpp | 158 /// 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 935 BlockFrequency Cost; local 961 BlockFrequency Cost = 0; local 1218 BlockFrequency Cost; local [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...] |
H A D | TargetLoweringBase.cpp | 1089 uint8_t Cost; local 1090 tie(RRC, Cost) = findRepresentativeClass((MVT::SimpleValueType)i); 1092 RepRegClassCostForVT[i] = Cost; 1316 unsigned Cost = 1; local 1324 return std::make_pair(Cost, MTy.getSimpleVT()); 1327 Cost *= 2;
|
/freebsd-10-stable/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 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
|
/freebsd-10-stable/contrib/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 219 return LT.first * AVX2CostTable[Idx].Cost; 246 return LT.first * SSE2UniformConstCostTable[Idx].Cost; 293 return LT.first * SSE2CostTable[Idx].Cost; 317 return LT.first * AVX1CostTable[Idx].Cost; 329 return LT.first * CustomLowered[Idx].Cost; 349 unsigned Cost = 1; local 351 Cost = 3; // Extract + insert + copy. 354 return Cost * LT.first; 392 return LTSrc.first * SSE2ConvTbl[Idx].Cost; 454 return AVXConversionTbl[Idx].Cost; 544 unsigned Cost = 0; local 575 unsigned Cost = TargetTransformInfo::getMemoryOpCost(Opcode, local 592 unsigned Cost = LT.first * 1; local [all...] |
H A D | X86ISelDAGToDAG.cpp | 1152 int Cost = 0; local 1163 ++Cost; 1170 --Cost; 1176 --Cost; 1178 if (Cost >= 0) {
|
/freebsd-10-stable/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 239 unsigned Cost = LT.first * 1; local 245 Cost *= (SrcBytes/Alignment); 247 return Cost;
|
/freebsd-10-stable/contrib/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 476 DiffEntry() : Cost(0) {} 478 unsigned Cost; member in struct:__anon3827::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-10-stable/contrib/llvm/lib/Analysis/IPA/ |
H A D | InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===// 55 int Cost; member in class:__anon2204::CallAnalyzer 147 : TD(TD), TTI(TTI), F(Callee), Threshold(Threshold), Cost(0), 161 int getCost() { return Cost; } 207 Cost += CostIt->second; 757 Cost += CS.arg_size() * InlineConstants::InstrCost; 762 Cost += InlineConstants::CallPenalty; 774 Cost += CS.arg_size() * InlineConstants::InstrCost; 791 Cost -= std::max(0, InlineConstants::IndirectCallThreshold - CA.getCost()); 887 Cost [all...] |
/freebsd-10-stable/contrib/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 200 return LT.first * NEONFltDblTbl[Idx].Cost; 292 return NEONVectorConversionTbl[Idx].Cost; 323 return NEONFloatConversionTbl[Idx].Cost; 355 return NEONIntegerConversionTbl[Idx].Cost; 375 return ARMIntegerConversionTbl[Idx].Cost; 418 return NEONVectorSelectTbl[Idx].Cost; 469 return LT.first * NEONShuffleTbl[Idx].Cost; 527 return LT.first * CostTbl[Idx].Cost; 529 unsigned Cost = local 541 Cost [all...] |
/freebsd-10-stable/contrib/llvm/lib/Analysis/ |
H A D | CostModel.cpp | 1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===// 69 static const char cm_name[] = "Cost Model Analysis"; 509 unsigned Cost = getInstructionCost(Inst); local 510 if (Cost != (unsigned)-1) 511 OS << "Cost Model: Found an estimated cost of " << Cost; local 513 OS << "Cost Model: Unknown cost";
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 1061 // Cost of wide load - cost of scalar loads. 1095 int Cost = 0; local 1113 Cost += C; 1126 DEBUG(dbgs() << "SLP: Total Cost " << Cost + ExtractCost<< ".\n"); 1127 return Cost + ExtractCost; 1131 int Cost = 0; local 1133 Cost += TTI->getVectorInstrCost(Instruction::InsertElement, Ty, i); 1134 return Cost; 1916 int Cost local 2073 int Cost = R.getTreeCost(); local 2321 int Cost = V.getTreeCost() + getReductionCost(TTI, ReducedVals[i]); local [all...] |
H A D | LoopVectorize.cpp | 687 unsigned Cost; // Cost of the loop with that width member in struct:__anon2859::LoopVectorizationCostModel::VectorizationFactor 966 VF.Cost); 4501 float Cost = expectedCost(1); 4503 DEBUG(dbgs() << "LV: Scalar loop costs: " << (int)Cost << ".\n"); 4511 if (VectorCost < Cost) { 4512 Cost = VectorCost; 4519 Factor.Cost = Width * Cost; 4779 unsigned Cost [all...] |
/freebsd-10-stable/sys/dev/isp/ |
H A D | Hardware.txt | 127 Approx Cost: Copper GBICs are 70$ each. Opticals are twice that or more. 161 Approx Cost: The last I saw for a price list item on this was 22K$ 173 Cost: I have no idea. 183 Cost: I have no idea. 203 Approx Cost: You'll find that FC drives are the same cost if not
|
/freebsd-10-stable/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGSDNodes.cpp | 113 unsigned &PhysReg, int &Cost) { 129 Cost = RC->getCopyCost(); 474 int Cost = 1; 476 CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost); 484 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...] |
H A D | DAGCombiner.cpp | 7599 struct Cost { struct in struct:__anon2317::LoadedSlice 7609 Cost(bool ForCodeSize = false) function in struct:__anon2317::LoadedSlice::Cost 7614 Cost(const LoadedSlice &LS, bool ForCodeSize = false) function in struct:__anon2317::LoadedSlice::Cost 7642 Cost &operator+=(const Cost &RHS) { 7651 bool operator==(const Cost &RHS) const { 7657 bool operator!=(const Cost &RHS) const { return !(*this == RHS); } 7659 bool operator<(const Cost &RHS) const { 7672 bool operator>(const Cost &RHS) const { return RHS < *this; } 7674 bool operator<=(const Cost [all...] |
/freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 788 /// Cost - This class is used to measure and compare candidate formulae. 789 class Cost { class in namespace:__anon2790 801 Cost() function in class:__anon2790::Cost 805 bool operator<(const Cost &Other) const; 852 void Cost::RateRegister(const SCEV *Reg, 900 void Cost::RatePrimaryRegister(const SCEV *Reg, 916 void Cost::RateFormula(const TargetTransformInfo &TTI, 971 void Cost::Loose() { 982 bool Cost::operator<(const Cost [all...] |
/freebsd-10-stable/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelLowering.cpp | 415 uint8_t Cost = 1; local 421 Cost = 2; 425 Cost = 4; 428 return std::make_pair(RRC, Cost);
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 290 unsigned Cost = ComputeSpeculationCost(I); local 292 if (Cost > CostRemaining) 295 CostRemaining -= Cost;
|