Lines Matching refs:CallBase

45 llvm::InlineCost getInlineCostWrapper(CallBase &CB,  in getInlineCostWrapper()
77   SizePriority(const CallBase *CB, FunctionAnalysisManager &,  in SizePriority()
94   CostPriority(const CallBase *CB, FunctionAnalysisManager &FAM,  in CostPriority()
96     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);  in CostPriority()
114   CostBenefitPriority(const CallBase *CB, FunctionAnalysisManager &FAM,  in CostBenefitPriority()
116     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);  in CostBenefitPriority()
185   MLPriority(const CallBase *CB, FunctionAnalysisManager &FAM,  in MLPriority()
187     auto IC = getInlineCostWrapper(const_cast<CallBase &>(*CB), FAM, Params);  in MLPriority()
203 class PriorityInlineOrder : public InlineOrder<std::pair<CallBase *, int>> {
204   using T = std::pair<CallBase *, int>;
206   bool hasLowerPriority(const CallBase *L, const CallBase *R) const {  in hasLowerPriority()
213   bool updateAndCheckDecreased(const CallBase *CB) {  in updateAndCheckDecreased()
239     isLess = [&](const CallBase *L, const CallBase *R) {  in PriorityInlineOrder()
247     CallBase *CB = Elt.first;  in push()
260     CallBase *CB = Heap.pop_back_val();  in pop()
267     auto PredWrapper = [=](CallBase *CB) -> bool {  in erase_if()
275   SmallVector<CallBase *, 16> Heap;
276   std::function<bool(const CallBase *L, const CallBase *R)> isLess;
277   DenseMap<CallBase *, int> InlineHistoryMap;
278   DenseMap<const CallBase *, PriorityT> Priorities;
288 std::unique_ptr<InlineOrder<std::pair<CallBase *, int>>>
313 std::unique_ptr<InlineOrder<std::pair<CallBase *, int>>>