Lines Matching defs:BestCost

277   int BestCost = -1;
548     if (BestCost == -1 || CurrCost < BestCost) {
550       BestCost = CurrCost;
551       LLVM_DEBUG(dbgs() << "Found Fit with cost " << BestCost << "\n");
553     assert(BestCost >= 0);
560   return (DoneExploring || BestCost == 0);
629     if (BestCost != -1 && (CurrCost + I->second > BestCost))
660     if (CurrCost < BestCost || BestCost == -1) {
662         FinishedExploring = BestCost != 0;
686   if (CurrCost < BestCost || BestCost == -1) {
688       bool FinishedExploring = BestCost != 0;
751     BestCost += TempCost;
753     BestCost += MissPenalty;
759   BestCost = 0;
798     LLVM_DEBUG(dbgs() << "Greedy produced best cost of " << BestCost << "\n");
799     if (BestCost > 0) {
802       LLVM_DEBUG(dbgs() << "Exact produced best cost of " << BestCost << "\n");