Searched refs:TotalCost (Results 1 – 5 of 5) sorted by relevance
85 unsigned TotalCost = 0; in estimateTotalCost() local88 TotalCost += computeCostFor(BF, SkipPredicate, SchedPolicy); in estimateTotalCost()92 if (TotalCost == 0) { in estimateTotalCost()97 TotalCost = BC.getBinaryFunctions().size(); in estimateTotalCost()99 return TotalCost; in estimateTotalCost()141 const unsigned TotalCost = estimateTotalCost(BC, SkipPredicate, SchedPolicy); in runOnEachFunction() local144 TotalCost > BlocksCount ? TotalCost / BlocksCount : 1; in runOnEachFunction()198 const unsigned TotalCost = estimateTotalCost(BC, SkipPredicate, SchedPolicy); in runOnEachFunctionWithUniqueAllocId() local201 TotalCost > BlocksCount ? TotalCost / BlocksCount : 1; in runOnEachFunctionWithUniqueAllocId()
599 InstructionCost TotalCost = 0; in getSpecializationBonus() local601 TotalCost += getUserBonus(U, TTI, LI); in getSpecializationBonus()603 TotalCost.print(dbgs()); dbgs() << " for: " << *U << "\n"); in getSpecializationBonus()611 return TotalCost; in getSpecializationBonus()654 return TotalCost + Bonus; in getSpecializationBonus()
2603 InstructionCost TotalCost = ComparisonCost * BranchCost * DifferentBlocks; in findCostForOutputBlocks() local2605 LLVM_DEBUG(dbgs() << "Adding: " << TotalCost in findCostForOutputBlocks()2608 OutputCost += TotalCost * NumOutputBranches; in findCostForOutputBlocks()
98 int64_t TotalCost = 0; in run() local103 TotalCost += Edge.Cost * Edge.Flow; in run()111 << " of " << TotalCost << " cost\n"); in run()114 return TotalCost; in run()
321 int TotalCost = TotalSecondaryCost + IC.getCost() * NumCallerUsers; in shouldBeDeferred() local323 return TotalCost < Allowance; in shouldBeDeferred()