Searched refs:BestCost (Results 1 - 9 of 9) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DRegAllocGreedy.cpp620 EvictionCost BestCost(~0u);
626 BestCost.BrokenHints = 0;
627 BestCost.MaxWeight = VirtReg.weight;
644 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost))
1089 float BestCost;
1097 BestCost = HUGE_VALF;
1101 BestCost = Hysteresis * calcSpillCost();
1102 DEBUG(dbgs() << "Cost of isolating all blocks = " << BestCost << '\n');
1135 if (Cost >= BestCost) {
1163 if (Cost < BestCost) {
[all...]
H A DRegAllocFast.cpp515 unsigned BestReg = 0, BestCost = spillImpossible; local
520 DEBUG(dbgs() << "\tBestCost: " << BestCost << "\n");
524 if (Cost < BestCost)
525 BestReg = *I, BestCost = Cost;
/external/llvm/lib/CodeGen/GlobalISel/
H A DRegBankSelect.cpp348 const RegBankSelect::MappingCost *BestCost) {
349 assert((MBFI || !BestCost) && "Costs comparison require MBFI");
358 if (BestCost && Cost > *BestCost)
406 if (!BestCost || Saturated)
457 if (BestCost && Cost > *BestCost)
345 computeMapping( MachineInstr &MI, const RegisterBankInfo::InstructionMapping &InstrMapping, SmallVectorImpl<RepairingPlacement> &RepairPts, const RegBankSelect::MappingCost *BestCost) argument
/external/llvm/lib/CodeGen/
H A DRegAllocGreedy.cpp375 BlockFrequency &BestCost,
865 EvictionCost BestCost; local
866 BestCost.setMax();
873 BestCost.BrokenHints = 0;
874 BestCost.MaxWeight = VirtReg.weight;
906 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost))
1356 BlockFrequency BestCost; local
1363 BestCost = BlockFrequency::getMaxFrequency();
1367 BestCost = calcSpillCost();
1369 MBFI->printBlockFreq(dbgs(), BestCost) << '\ local
1383 calculateRegionSplitCost(LiveInterval &VirtReg, AllocationOrder &Order, BlockFrequency &BestCost, unsigned &NumCands, bool IgnoreCSR) argument
[all...]
H A DRegAllocFast.cpp566 unsigned BestReg = 0, BestCost = spillImpossible; local
571 DEBUG(dbgs() << "\tBestCost: " << BestCost << "\n");
577 if (Cost < BestCost)
578 BestReg = *I, BestCost = Cost;
/external/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.h127 BestCost}; enumerator in enum:llvm::ConvergingVLIWScheduler::CandResult
H A DHexagonMachineScheduler.cpp572 FoundCandidate = BestCost;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp604 int BestCost = SUSchedulingCost(*Best); local
608 if (SUSchedulingCost(*I) > BestCost) {
609 BestCost = SUSchedulingCost(*I);
/external/llvm/include/llvm/CodeGen/GlobalISel/
H A DRegBankSelect.h548 /// \p BestCost is used to specify when the cost becomes too high
550 /// \p BestCost == nullptr, the mapping cost is actually not
556 const MappingCost *BestCost = nullptr);

Completed in 183 milliseconds