25 enum class InlinePriorityMode : int { Size, Cost, CostBenefit, ML };  enumerator
32                clEnumValN(InlinePriorityMode::Cost, "cost",
98       Cost = IC.getCost();  in CostPriority()
100       Cost = IC.isNever() ? INT_MAX : INT_MIN;  in CostPriority()
104     return P1.Cost < P2.Cost;  in isMoreDesirable()
108   int Cost = INT_MAX;  member in __anona7cbcc7e0111::CostPriority
118       Cost = IC.getCost();  in CostBenefitPriority()
120       Cost = IC.isNever() ? INT_MAX : INT_MIN;  in CostBenefitPriority()
143         P1.Cost + P1.StaticBonusApplied < ModuleInlinerTopPriorityThreshold;  in isMoreDesirable()
145         P2.Cost + P2.StaticBonusApplied < ModuleInlinerTopPriorityThreshold;  in isMoreDesirable()
154       return P1.Cost < P2.Cost;  in isMoreDesirable()
173     return P1.Cost < P2.Cost;  in isMoreDesirable()
177   int Cost = INT_MAX;  member in __anona7cbcc7e0111::CostBenefitPriority
189       Cost = IC.getCost();  in MLPriority()
191       Cost = IC.isNever() ? INT_MAX : INT_MIN;  in MLPriority()
195     return P1.Cost < P2.Cost;  in isMoreDesirable()
199   int Cost = INT_MAX;  member in __anona7cbcc7e0111::MLPriority
297   case InlinePriorityMode::Cost:  in getDefaultInlineOrder()