Lines Matching defs:BestCost

295   int BestCost = -1;
567     if (BestCost == -1 || CurrCost < BestCost) {
569       BestCost = CurrCost;
570       LLVM_DEBUG(dbgs() << "Found Fit with cost " << BestCost << "\n");
572     assert(BestCost >= 0);
579   return (DoneExploring || BestCost == 0);
648     if (BestCost != -1 && (CurrCost + I->second > BestCost))
679     if (CurrCost < BestCost || BestCost == -1) {
681         FinishedExploring = BestCost != 0;
705   if (CurrCost < BestCost || BestCost == -1) {
707       bool FinishedExploring = BestCost != 0;
770     BestCost += TempCost;
772     BestCost += MissPenalty;
778   BestCost = 0;
817     LLVM_DEBUG(dbgs() << "Greedy produced best cost of " << BestCost << "\n");
818     if (BestCost > 0) {
821       LLVM_DEBUG(dbgs() << "Exact produced best cost of " << BestCost << "\n");