HomeSort by: relevance | last modified time | path
    Searched refs:BestCost (Results 1 - 7 of 7) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegAllocGreedy.cpp 499 BlockFrequency &BestCost,
1158 EvictionCost BestCost;
1159 BestCost.setMax();
1166 BestCost.BrokenHints = 0;
1167 BestCost.MaxWeight = VirtReg.weight();
1203 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost,
1843 BlockFrequency BestCost;
1850 BestCost = BlockFrequency::getMaxFrequency();
1854 BestCost = SpillCost;
1856 MBFI->printBlockFreq(dbgs(), BestCost) << '\n')
    [all...]
RegAllocFast.cpp 776 unsigned BestCost = spillImpossible;
786 LLVM_DEBUG(dbgs() << "Cost: " << Cost << " BestCost: " << BestCost << '\n');
796 if (Cost < BestCost) {
798 BestCost = Cost;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
RegBankSelect.cpp 445 const RegBankSelect::MappingCost *BestCost) {
446 assert((MBFI || !BestCost) && "Costs comparison require MBFI");
458 if (BestCost && Cost > *BestCost) {
510 if (!BestCost || Saturated)
566 if (BestCost && Cost > *BestCost) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ResourcePriorityQueue.cpp 596 int BestCost = SUSchedulingCost(*Best);
599 if (SUSchedulingCost(*I) > BestCost) {
600 BestCost = SUSchedulingCost(*I);
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.h 128 BestCost, Weak};
HexagonMachineScheduler.cpp 815 FoundCandidate = BestCost;
847 FoundCandidate = BestCost;
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h 588 /// \p BestCost is used to specify when the cost becomes too high
590 /// \p BestCost == nullptr, the mapping cost is actually not
596 const MappingCost *BestCost = nullptr);

Completed in 96 milliseconds