Searched refs:BestCost (Results 1 – 11 of 11) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocEvictionAdvisor.cpp | 335 EvictionCost BestCost; in tryFindEvictionCandidate() local
336 BestCost.setMax(); in tryFindEvictionCandidate()
346 BestCost.BrokenHints = 0; in tryFindEvictionCandidate()
347 BestCost.MaxWeight = VirtReg.weight(); in tryFindEvictionCandidate()
355 !canEvictInterferenceBasedOnCost(VirtReg, PhysReg, false, BestCost, in tryFindEvictionCandidate()
|
| H A D | RegAllocGreedy.cpp | 1202 BlockFrequency BestCost; in tryRegionSplit() local
1209 BestCost = BlockFrequency::max(); in tryRegionSplit()
1213 BestCost = SpillCost; in tryRegionSplit()
1215 << printBlockFreq(*MBFI, BestCost) << '\n'); in tryRegionSplit()
1218 unsigned BestCand = calculateRegionSplitCost(VirtReg, Order, BestCost, in tryRegionSplit()
1231 BlockFrequency &BestCost, in calculateRegionSplitCostAroundReg() argument
1267 if (Cost >= BestCost) { in calculateRegionSplitCostAroundReg()
1297 if (Cost < BestCost) { in calculateRegionSplitCostAroundReg()
1299 BestCost = Cost; in calculateRegionSplitCostAroundReg()
1308 BlockFrequency &BestCost, in calculateRegionSplitCost() argument
[all …]
|
| H A D | RegAllocGreedy.h | 342 BlockFrequency &BestCost,
348 BlockFrequency &BestCost,
|
| H A D | RegAllocFast.cpp | 956 unsigned BestCost = spillImpossible; in allocVirtReg() local
966 LLVM_DEBUG(dbgs() << "Cost: " << Cost << " BestCost: " << BestCost << '\n'); in allocVirtReg()
976 if (Cost < BestCost) { in allocVirtReg()
978 BestCost = Cost; in allocVirtReg()
|
| H A D | VLIWMachineScheduler.cpp | 817 FoundCandidate = BestCost; in pickNodeFromQueue()
849 FoundCandidate = BestCost; in pickNodeFromQueue()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUIGroupLP.cpp | 277 int BestCost = -1; member in __anon5d856e630111::PipelineSolver
548 if (BestCost == -1 || CurrCost < BestCost) { in checkOptimal()
550 BestCost = CurrCost; in checkOptimal()
551 LLVM_DEBUG(dbgs() << "Found Fit with cost " << BestCost << "\n"); in checkOptimal()
553 assert(BestCost >= 0); in checkOptimal()
560 return (DoneExploring || BestCost == 0); in checkOptimal()
625 if (BestCost != -1 && (CurrCost + I->second > BestCost)) in solveExact()
656 if (CurrCost < BestCost || BestCost == -1) { in solveExact()
658 FinishedExploring = BestCost != 0; in solveExact()
682 if (CurrCost < BestCost || BestCost == -1) { in solveExact()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.cpp | 446 const RegBankSelect::MappingCost *BestCost) { in computeMapping() argument
447 assert((MBFI || !BestCost) && "Costs comparison require MBFI"); in computeMapping()
460 if (BestCost && Cost > *BestCost) { in computeMapping()
517 if (!BestCost || Saturated) in computeMapping()
573 if (BestCost && Cost > *BestCost) { in computeMapping()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ResourcePriorityQueue.cpp | 591 int BestCost = SUSchedulingCost(*Best); in pop() local
594 if (SUSchedulingCost(*I) > BestCost) { in pop()
595 BestCost = SUSchedulingCost(*I); in pop()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | VLIWMachineScheduler.h | 113 BestCost, enumerator
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.h | 596 const MappingCost *BestCost = nullptr);
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 20457 InstructionCost BestCost = in collectValuesToDemote() local
20470 if (Cost < BestCost) { in collectValuesToDemote()
20471 BestCost = Cost; in collectValuesToDemote()
|