Searched refs:BestCost (Results 1 – 7 of 7) sorted by relevance
445 const RegBankSelect::MappingCost *BestCost) { in computeMapping() argument446 assert((MBFI || !BestCost) && "Costs comparison require MBFI"); in computeMapping()458 if (BestCost && Cost > *BestCost) { in computeMapping()510 if (!BestCost || Saturated) in computeMapping()566 if (BestCost && Cost > *BestCost) { in computeMapping()
493 BlockFrequency &BestCost,1115 EvictionCost BestCost; in tryEvict() local1116 BestCost.setMax(); in tryEvict()1123 BestCost.BrokenHints = 0; in tryEvict()1124 BestCost.MaxWeight = VirtReg.weight; in tryEvict()1158 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost, in tryEvict()1835 BlockFrequency BestCost; in tryRegionSplit() local1842 BestCost = BlockFrequency::getMaxFrequency(); in tryRegionSplit()1846 BestCost = SpillCost; in tryRegionSplit()1848 MBFI->printBlockFreq(dbgs(), BestCost) << '\n'); in tryRegionSplit()[all …]
715 unsigned BestCost = spillImpossible; in allocVirtReg() local720 LLVM_DEBUG(dbgs() << "Cost: " << Cost << " BestCost: " << BestCost << '\n'); in allocVirtReg()730 if (Cost < BestCost) { in allocVirtReg()732 BestCost = Cost; in allocVirtReg()
592 int BestCost = SUSchedulingCost(*Best); in pop() local595 if (SUSchedulingCost(*I) > BestCost) { in pop()596 BestCost = SUSchedulingCost(*I); in pop()
128 BestCost, Weak}; enumerator
815 FoundCandidate = BestCost; in pickNodeFromQueue()847 FoundCandidate = BestCost; in pickNodeFromQueue()
595 const MappingCost *BestCost = nullptr);