Searched refs:BestCost (Results 1 – 6 of 6) sorted by relevance
| /external/llvm/test/CodeGen/ARM/ |
| D | commute-movcc.ll | 32 %BestCost.011 = phi i32 [ -1, %entry ], [ %BestCost.1, %if.end8 ]
42 %cmp3 = icmp ult i32 %mul, %BestCost.011
44 %mul.BestCost.0 = select i1 %cmp3, i32 %mul, i32 %BestCost.011
48 %cmp5 = icmp ugt i32 %mul, %BestCost.011
50 %BestCost.0.mul = select i1 %cmp5, i32 %BestCost.011, i32 %mul
55 %BestCost.1 = phi i32 [ %mul.BestCost.0, %if.then ], [ %BestCost.0.mul, %if.else ]
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 360 BlockFrequency &BestCost,
830 EvictionCost BestCost; in tryEvict() local
831 BestCost.setMax(); in tryEvict()
838 BestCost.BrokenHints = 0; in tryEvict()
839 BestCost.MaxWeight = VirtReg.weight; in tryEvict()
872 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost)) in tryEvict()
1316 BlockFrequency BestCost; in tryRegionSplit() local
1323 BestCost = BlockFrequency::getMaxFrequency(); in tryRegionSplit()
1327 BestCost = calcSpillCost(); in tryRegionSplit()
1329 MBFI->printBlockFreq(dbgs(), BestCost) << '\n'); in tryRegionSplit()
[all …]
|
| D | RegAllocFast.cpp | 557 unsigned BestReg = 0, BestCost = spillImpossible; in allocVirtReg() local
562 DEBUG(dbgs() << "\tBestCost: " << BestCost << "\n"); in allocVirtReg()
568 if (Cost < BestCost) in allocVirtReg()
569 BestReg = *I, BestCost = Cost; in allocVirtReg()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ResourcePriorityQueue.cpp | 604 signed BestCost = SUSchedulingCost(*Best); in pop() local
608 if (SUSchedulingCost(*I) > BestCost) { in pop()
609 BestCost = SUSchedulingCost(*I); in pop()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 128 BestCost}; enumerator
|
| D | HexagonMachineScheduler.cpp | 568 FoundCandidate = BestCost; in pickNodeFromQueue()
|