| /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-project/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/GlobalISel/ |
| D | RegBankSelect.cpp | 348 const RegBankSelect::MappingCost *BestCost) { in computeMapping() argument
349 assert((MBFI || !BestCost) && "Costs comparison require MBFI"); in computeMapping()
358 if (BestCost && Cost > *BestCost) in computeMapping()
406 if (!BestCost || Saturated) in computeMapping()
457 if (BestCost && Cost > *BestCost) in computeMapping()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/ |
| D | RegBankSelect.cpp | 445 const RegBankSelect::MappingCost *BestCost) { in computeMapping() argument
446 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()
|
| /external/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| D | RegBankSelect.cpp | 445 const RegBankSelect::MappingCost *BestCost) { in computeMapping() argument
446 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()
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 375 BlockFrequency &BestCost,
865 EvictionCost BestCost; in tryEvict() local
866 BestCost.setMax(); in tryEvict()
873 BestCost.BrokenHints = 0; in tryEvict()
874 BestCost.MaxWeight = VirtReg.weight; in tryEvict()
906 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost)) in tryEvict()
1356 BlockFrequency BestCost; in tryRegionSplit() local
1363 BestCost = BlockFrequency::getMaxFrequency(); in tryRegionSplit()
1367 BestCost = calcSpillCost(); in tryRegionSplit()
1369 MBFI->printBlockFreq(dbgs(), BestCost) << '\n'); in tryRegionSplit()
[all …]
|
| D | RegAllocFast.cpp | 566 unsigned BestReg = 0, BestCost = spillImpossible; in allocVirtReg() local
571 DEBUG(dbgs() << "\tBestCost: " << BestCost << "\n"); in allocVirtReg()
577 if (Cost < BestCost) in allocVirtReg()
578 BestReg = *I, BestCost = Cost; in allocVirtReg()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 493 BlockFrequency &BestCost,
1115 EvictionCost BestCost; in tryEvict() local
1116 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() local
1842 BestCost = BlockFrequency::getMaxFrequency(); in tryRegionSplit()
1846 BestCost = SpillCost; in tryRegionSplit()
1848 MBFI->printBlockFreq(dbgs(), BestCost) << '\n'); in tryRegionSplit()
[all …]
|
| D | RegAllocFast.cpp | 715 unsigned BestCost = spillImpossible; in allocVirtReg() local
720 LLVM_DEBUG(dbgs() << "Cost: " << Cost << " BestCost: " << BestCost << '\n'); in allocVirtReg()
730 if (Cost < BestCost) { in allocVirtReg()
732 BestCost = Cost; in allocVirtReg()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 493 BlockFrequency &BestCost,
1121 EvictionCost BestCost; in tryEvict() local
1122 BestCost.setMax(); in tryEvict()
1129 BestCost.BrokenHints = 0; in tryEvict()
1130 BestCost.MaxWeight = VirtReg.weight(); in tryEvict()
1166 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost, in tryEvict()
1825 BlockFrequency BestCost; in tryRegionSplit() local
1832 BestCost = BlockFrequency::getMaxFrequency(); in tryRegionSplit()
1836 BestCost = SpillCost; in tryRegionSplit()
1838 MBFI->printBlockFreq(dbgs(), BestCost) << '\n'); in tryRegionSplit()
[all …]
|
| D | RegAllocFast.cpp | 748 unsigned BestCost = spillImpossible; in allocVirtReg() local
758 LLVM_DEBUG(dbgs() << "Cost: " << Cost << " BestCost: " << BestCost << '\n'); in allocVirtReg()
768 if (Cost < BestCost) { in allocVirtReg()
770 BestCost = Cost; in allocVirtReg()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | ResourcePriorityQueue.cpp | 592 int BestCost = SUSchedulingCost(*Best); in pop() local
595 if (SUSchedulingCost(*I) > BestCost) { in pop()
596 BestCost = SUSchedulingCost(*I); in pop()
|
| /external/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| D | ResourcePriorityQueue.cpp | 596 int BestCost = SUSchedulingCost(*Best); in pop() local
599 if (SUSchedulingCost(*I) > BestCost) { in pop()
600 BestCost = SUSchedulingCost(*I); in pop()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ResourcePriorityQueue.cpp | 604 int BestCost = SUSchedulingCost(*Best); in pop() local
608 if (SUSchedulingCost(*I) > BestCost) { in pop()
609 BestCost = SUSchedulingCost(*I); in pop()
|
| /external/llvm-project/clang-tools-extra/clangd/refactor/ |
| D | Rename.cpp | 800 size_t BestCost = std::numeric_limits<size_t>::max(); in getMappedRanges() local
808 if (MCost < BestCost) { in getMappedRanges()
809 BestCost = MCost; in getMappedRanges()
814 if (MCost == BestCost) in getMappedRanges()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 127 BestCost}; enumerator
|
| D | HexagonMachineScheduler.cpp | 572 FoundCandidate = BestCost; in pickNodeFromQueue()
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 128 BestCost, Weak}; enumerator
|
| D | HexagonMachineScheduler.cpp | 815 FoundCandidate = BestCost; in pickNodeFromQueue()
847 FoundCandidate = BestCost; in pickNodeFromQueue()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 128 BestCost, Weak}; enumerator
|
| D | HexagonMachineScheduler.cpp | 815 FoundCandidate = BestCost; in pickNodeFromQueue()
847 FoundCandidate = BestCost; in pickNodeFromQueue()
|
| /external/llvm/include/llvm/CodeGen/GlobalISel/ |
| D | RegBankSelect.h | 556 const MappingCost *BestCost = nullptr);
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/GlobalISel/ |
| D | RegBankSelect.h | 595 const MappingCost *BestCost = nullptr);
|
| /external/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| D | RegBankSelect.h | 595 const MappingCost *BestCost = nullptr);
|
| /external/llvm-project/clang-tools-extra/clangd/ |
| D | XRefs.cpp | 582 unsigned BestCost = -1; in findNearbyIdentifier() local
614 if (TokCost >= BestCost) in findNearbyIdentifier()
621 BestCost = TokCost; in findNearbyIdentifier()
|