Searched refs:MaxCost (Results 1 - 3 of 3) sorted by relevance

/external/llvm/utils/PerfectShuffle/
H A DPerfectShuffle.cpp241 unsigned MaxCost = ShufTab[0].Cost;
244 if (ShufTab[i].Cost > MaxCost)
245 MaxCost = ShufTab[i].Cost;
300 if (ShufTab[LHS].Cost + 1 >= MaxCost)
328 if (ShufTab[RHS].Cost + 1 >= MaxCost)
/external/llvm/lib/CodeGen/
H A DRegAllocGreedy.cpp634 EvictionCost MaxCost; local
635 MaxCost.setBrokenHints(1);
636 if (canEvictInterference(VirtReg, Hint, true, MaxCost)) {
720 /// @param MaxCost Only look for cheaper candidates and update with new cost
722 /// @returns True when interference can be evicted cheaper than MaxCost.
724 bool IsHint, EvictionCost &MaxCost) {
782 if (!(Cost < MaxCost))
789 // If !MaxCost.isMax(), then we're just looking for a cheap register.
792 if (!MaxCost.isMax() && IsLocal && LIS->intervalIsInOneMBB(*Intf) &&
798 MaxCost
723 canEvictInterference(LiveInterval &VirtReg, unsigned PhysReg, bool IsHint, EvictionCost &MaxCost) argument
[all...]
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp1601 unsigned MaxCost = 2 * PHINodeFoldingThreshold * local
1603 if (OrigCost + ThenCost > MaxCost)

Completed in 92 milliseconds